Programming Articles - Page 1755 of 3363

Suppose we have a sorted array of positive numbers, this array is sorted in ascending order, er have to find the smallest positive value that cannot be represented as sum of elements of any subset of given set. We have to solve this problem in O(n) time.So, if the input is like A = [1, 4, 8, 12, 13, 17], then the output will be 2.To solve this, we will follow these steps −n := size of Aanswer := 1for i in range 0 to n, doif A[i]

Suppose we have a given weighted undirected graph with N different nodes and M edges, some of the nodes are good nodes. We have to find the shortest distance between any pair of two different good nodes. In the given diagram the yellow in the following graph are considered to be good nodes.So, if the input is likethen the output will be 11, as the pairs of good nodes and distance between them are: (1 to 3) the distance is 11, (3 to 5) the distance is 13, (1 to 5) the distance is 24, out of which 11 is ... Read More

Suppose we have a number N this represents the initial position of the person on the number line. We also have L which is the probability of the person of going left. We have to find the the probability of reaching all points on the number line after completing N moves from point N. Each move can be either to the left or to the right.So, if the input is like n = 2, l = 0.5, then the output will be [0.25, 0, 0.5, 0, 0.25]To solve this, we will follow these steps −high := 1 - lowDefine an ... Read More

Suppose we have a Markov chain graph g; we have the find the probability to reach the state F at time T if we start from state S when time t = 0. As we know a Markov chain is a random process consisting of various states and the probabilities to move one state to another. This can be represented as a directed graph; the nodes are states and the edges have the probability of going from one node to another. From one state to another, it takes unit time to move. The sum of the probabilities of the outgoing ... Read More

Suppose we have two arrays A and B. The size of A is the number of rows and A[i] is the number of boxes in the ith row. And B is the array of balls where B[i] denotes a number on the ball. Given that ball i (value B[i]) will be placed in a box whose position from starting is B[i]. We have to find the row and column of the boxes corresponding to each B[i].So, if the input is like A = [3, 4, 5, 6], B = [1, 3, 5, 2], then the output will be [(1, 1), ... Read More

Suppose we have a string S with lowercase letters, now two players are playing the game. The rules are as follows −The player wins the game, if, at any move, a player can shuffle the characters of the string to get a palindrome string.The player cannot win when he/she has to remove any character from the string.We have to keep in mind that both players play the game optimally and player1 starts the game. We have to find the winner of the game.So, if the input is like "pqpppq", then the output will be Player1 as player-1 in the first ... Read More

Suppose we have two arrays A and B of size N and M respectively and we also have one N X M binary matrix where 1 denotes that there was a positive integer in the original matrix and 0 means that position is holding 0 into the original matrix also. We have to generate the original matrix so that A[i] denotes the largest element in the ith row and B[j] denotes the largest element in the jth column.So, if the input is like A = [4, 2, 3], B = [3, 1, 0, 0, 4, 0, 5] matrix, then the ... Read More

Suppose we have n different tasks; these tasks are labeled from 0 to n-1. Some tasks may have prerequisites tasks, so as an example if we want to choose task 2 then we have to first finish the task 1, which is represented as a pair − [2, 1] If we have total number of tasks and a list of prerequisite pairs, we have to find the ordering of tasks to finish all tasks. If there are more than one correct order, we can just return one of them. And if it is impossible to finish all given tasks, return ... Read More

Suppose we have an array A containing the permutation of first N natural numbers and another number M is also given, where M ≤ N, we have to find the number of sub-arrays such that the median of the sequence is M. As we know the median of a sequence is defined as the value of the element which is in the middle of the sequence after sorting it according to ascending order. For even length sequence, the left of two middle elements is used.So, if the input is like A = [3, 5, 6, 4, 2] and M = ... Read More

There are n number of spectators in the stadium, and they are labeled from 1 to n. Now follow these cases −At time t1, the first spectator stands.At time t2, the second spectator stands.…At time tk, the k-th spectator stands.At time tk + 1, the (k + 1)-th spectator stands and the first spectator sits.At time tk + 2, the (k + 2)-th spectator stands and the second spectator sits.…At time tn, the n-th spectator stands and the (n – k)-th spectator sits.At time tn + 1, the (n + 1 – k)-th spectator sits.…At time tn + k, the ... Read More