Greedy: Minimum swaps to make strings equal
Problem Statement: You are given 2 strings, s1 and s2 of same size of letter x and y. You need make both of the strings equal by swapping any…
Greedy: Non overlapping intervals
Problem Statement: You are given a 2D array which represents interval. You need to find the minimum number of interval need to be removed to…
Greedy: Given three stacks, you need to find maximum equal sum
Problem Statement: You are given 3 stacks s1, s2, s3. You need to find the maximum possible equal sum that can be achieved by removing from…
Greedy: Assign maximum cookies
Problem Statement: You are given 2 arrays, greed[] and cookie[]. greed[i] is the minimum cookie size wanted by ith child. cookie[i] is the…
Greedy: Assign holes to mice
Problem Statement: You are given 2 arrays one for mice and one for hole. There are N mice and N holes and placed in a straight line. Each hole…
Greedy: Maximum odd binary number
Problem Statement: You are given a string, that has atleast one. Re-arrange the bits so that the number is the odd binary number and is the…
Binary Tree: Given a binary tree, invert it
Problem Statement Given a binary tree, invert it Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14 */ Output: /* * 10 * / \ * 12 8 *…
Binary Tree: Given a binary tree and two nodes, check if they are cousins
Problem Statement: Given a binary tree and two nodes, check if they are cousins Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14 */…
Binary Tree: Given two trees, check if the tree is subtree of another tree
Problem Statement: Given two trees, check if the tree is subtree of another tree. Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14…