Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Arnab Chakraborty
Page 285 of 377
Program to check there is any common reachable node in a graph or not in Python
Suppose we have an edge list of a directed graph, there are n nodes and node names are 0 to n- 1. We also have two integer values a and b. We have to check whether there is any node c such that we can go from c to a and also c to b.So, if the input is likeAnd a = 2, b = 3, then the output will be True, because here c = 0, so we have route from 0 to 2 and also 0 to 3.To solve this, we will follow these steps −Define a function ...
Read MoreProgram to find maximum coins we can get from disappearing coins matrix in Python
Suppose we have a 2D matrix where each cell matrix[r, c] represents the number of coins present in that cell. When we pick up coins from matrix[r, c], all the coins on row (r - 1) and (r + 1) will disappear, as well as the coins at the two cells matrix[r, c + 1] and matrix[r, c - 1]. We have to find the maximum number of coins we can collect.So, if the input is like28761010425923then the output will be 26 because we can pick cells with the coins 8, 6, and 9 and 3, so total is 26.To ...
Read MoreProgram to check all tasks can be executed using given server cores or not in Python
Suppose we have two lists, they are cores and tasks. The cores[i] indicates number of cores available in the ith server. And tasks[i] indicates the number of cores needed to execute that task. Each task must be run in only one server. And a server may have multiple tasks to run. We have to check whether it's possible to run all the tasks with the given cores or not.So, if the input is like cores = [10, 7] tasks = [7, 3, 2, 2, 1], then the output will be True, because we can put tasks[0] and tasks[1] into first ...
Read MoreProgram to check there is any forward path in circular cyclic list or not in Python
Suppose we have a circular list called nums. So the first and the last elements are neighbors. So starting from any index say i, we can move nums[i] number of steps forward if nums[i] is a positive value, otherwise backwards if it's a negative value. We have to check whether there is a cycle whose length is greater than one such that the path only goes forwards or only goes backwards.So, if the input is like nums = [-1, 2, -1, 1, 2], then the output will be True, because there is a forward path [1 -> 3 -> 4 ...
Read MoreProgram to count number of characters in each bracket depth in Python
Suppose we have a string s which consists of only three characters "X", "(", and ")". The string has balanced brackets and in between some "X"s are there along with possibly nested brackets may also there recursively. We have to find the number of "X"s at each depth of brackets in s, starting from the shallowest depth to the deepest depth.So, if the input is like s = "(XXX(X(XX))XX)", then the output will be [5, 1, 2]To solve this, we will follow these steps −depth := -1out := a new listfor each c in s, doif c is same as ...
Read MoreProgram to get final string after shifting characters with given number of positions in Python
Suppose we have a lowercase string s and another list of integers called shifts whose length is same as the length of s. Here each element in shifts[i] indicates it to shift the first i + 1 letters of s by shifts[i] positions. If shifting crosses 'z' it will be wrap up to 'a'. We have to find the resulting string after applying shifts to s.So, if the input is like s = "tomato" shifts = [2, 5, 2, 3, 7, 4], then the output will be "qjcoes" so, after shifting first character 2 places, it will be 't' to ...
Read MoreProgram to count number of horizontal brick pattern can be made from set of bricks in Python
Suppose we have a list of numbers called bricks and two other values width and height. Each element in bricks[i] represents a brick whose length is bricks[i] units and width is 1 unit. We have to find the number of ways to lay the bricks such that we get full layout of bricks with the given width and height. We can reuse the bricks but can only be laid horizontally.So, if the input is like bricks = [2, 1] width = 3 height = 2, then the output will be 9 because −To solve this, we will follow these steps ...
Read MoreProgram to find number of pairs where elements square is within the given range in Python
Suppose we have two list of numbers nums1 and nums2. And also have two numbers lower and upper. We have to find the number of pairs (i, j) such that lower ≤ nums1[i]^2 + nums2[j]^2 ≤ upper.So, if the input is like nums1 = [5, 3, 2] nums2 = [8, 12, 6] lower = 10 upper = 50, then the output will be 2 because the pairs are like (1, 2) and (2, 2)10
Read MoreProgram to check whether robot is moving inside a bounded box or not in Python
Suppose we have a string s, that represents the moves of a robot. Robot is currently at (0, 0) position and it is facing north. The move string s may have these characters"F" to move forward direction, one unit"L" to rotate 90 degrees’ left"R" to rotate 90 degrees’ rightSo if the robot repeatedly makes the moves in s in order, we have to check whether there is some box in the plane in which the robot never leaves or not.So, if the input is like s = "FFRFRFFRF", then the output will be True, because robot moves 2 units towards ...
Read MoreProgram to find bitwise AND of range of numbers in given range in Python
Suppose we have two values start and end, we have to find the bitwise AND of all numbers in the range [start, end] (both inclusive).So, if the input is like start = 8 end = 12, then the output will be 8 is 1000 in binary and 12 is 1100 in binary, so 1000 AND 1001 AND 1010 AND 1011 AND 1100 is 1000 which is 8.To solve this, we will follow these steps −n := end - start + 1x := 0for b in range 31 to 0, decrease by 1, doif 2^b < n, thencome out from loopif ...
Read More