Arrays: Merge sorted array inplace
Problem Statement: You are given with 2 sorted arrays, you need to merge the array in-place. You may assume that the first array will have…
Power Set
Problem Statement: You are given a set, you need to find all the subsets of that set. Example set = {a, b, c} Power set = {{}, {a}, {b}, {c},…
Copy set bits in a range
Problem Statement: You are given 2 numbers x and y and a range [i,r] 1 <= l, r <= 32. You need to set bits of y in range [l, r] that are…
Bitwise Set bit questions
Problem Statement: In this chapter we shall solve few problems related to Bitwise Set bit. 1. Find the total number of set bits from 1 to N 2.…
Count number of bits to be flipped to convert A to B
Problem Statement: You are given 2 integers A and B. You need to findout the number of bits to be flipped to convert A to B. Example Input : a…
Find the two non repeating numbers.
Problem Statement: You are given an array of repeating numbers(twice), but two numbers are not repeating. You need to find out those numbers.…
Dynamic Programming: Equal Sum partition
Problem Statement: You are given an array. You need to return true if you are able to divide the array into 2 subsets such that the sum of the…
Dynamic Programming: Unbounded Knapsack Problem
Problem Statement: You are given 2 arrays. Value array and corresponding weight associated with it. You need to calculate the maximum amount…
Dynamic Programming: Subset sum problem
Problem Statement: You are given a non-negtive integers and a sum, you need to check if there is a subset with the sum equal to the given sum.…
Dynamic Programming: Get the nth catalan number
Problem Statement: You are given an integer “n”, you need to get the “nth” catalan number. What is a Catalan Number? A…
