Backtracking: Find combination sum of k numbers that sum up to n
Problem Statement: You are given two numbers K and N, you need to find all valid combinations of k numbers that sum up to n. Such that only…
Backtracking: Get the k combination from an array of 1 to n
Problem Statement: You are given 2 integers n and k, you need to return all possible combination of K numbers from the range [1, n] Example…
Backtracking: You are given an array with repeated elements and a key element, find all unique combination to the key
Problem Statement: You are given an array with repeated elements, and a key element. You need to return the unique combination in that array…
Backtracking: Partition string into its palindrome
Problem Statement: You are given a string. You need to partition the string in such a way that, each substring is a palindrome. Example Input:…
Greedy: Find maximum sum possible equal sum of three stacks
Problem Statement: You are given 3 arrays that represents a stack. You need to remove the top elements of the stack such that the sum of all…
Greedy: Connect ropes with minimum cost.
Problem Statement: You are given n ropes of different length. You need to connect these ropes into one rope. The cost of connecting two ropes…
Greedy: String break problem
Problem Statement: You are given 2 string and you need to check if some permutation of s1 can break s2 or vice-versa. A string can break…
Greedy: Reduce the array size to the half
Problem Statement: You are given an array with repeated elements. You can choose set of integers and remove all the occurrence of the integers…
Greedy: Remove covered intervals.
Problem Statement: You are given a list of intervals, you need to remove all the intervals that are covered by other intervals and return the…
Greedy: Add minimum to make parentheses valid.
Problem Statement: You are given a string of ‘(‘ and ‘)’. You need to return the minimum number of parentheses to make…
