Find maximum cost path in a graph from a given source to a given destination
Given a weighted graph, find the maximum cost path from a given source to a destination that is greater than a given integer k. The path should not contain any cycles.
Tag: Medium
Find the minimum number of inversions needed to make an expression balanced
Given an expression consisting of an opening brace { and a closing brace }, find the minimum number of inversions needed to balance the expression.
Print all combinations of numbers from 1 to `n` having sum `n`
Given a positive integer n, print all combinations of numbers between 1 and n having sum n.
Circular shift on the binary representation of an integer by `k` positions
Given a positive integer n and k, perform a circular shift on the binary representation of n by k positions.
Find ways to calculate a target from elements of the specified array
Write a program to count the number of ways to calculate a target number from the specified array elements using only addition and subtraction operator. The use of any other operator is forbidden.
Print all combinations of phrases formed by picking words from each of the given lists
Given n lists of words, print all combinations of phrases that can be formed by picking one word from each list.
Rearrange a linked list by separating odd nodes from even ones
Given a linked list, rearrange it by separating odd nodes from even ones. All even nodes should come before all odd nodes in the output list, and the relative order of even and odd nodes should be maintained.
Generate random input from an array according to given probabilities
Write an algorithm to generate any one of the given n numbers according to given probabilities.
Find the maximum difference between a node and its descendants in a binary tree
Given a binary tree, find the maximum difference between a node and its descendants in it.
Print all shortest routes in a rectangular grid
Given an M × N rectangular grid, print all shortest routes in the grid that start at the first cell (0, 0) and ends at the last cell (M-1, N-1). We can move down or right or diagonally (down-right), but not up or left.
Check if an array is formed by consecutive integers
Given an integer array, check if only consecutive integers form the array.
Find the odd occurring element in an array in logarithmic time
Given an array of n integers where every element appears an even number of times except one element, which appears an odd number of times, find that odd occurring element in logarithmic time and constant space.