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…
Binary Tree: Given a binary tree, check if there is duplicate subtree and return the duplicate subtree
Problem Statement: You are given a root of a subtree, you need to return all the duplicate subtrees You need to return the root of each…
Binary Tree: Given a binary tree, check if duplicate values are present
Problem Statement: Given a binary tree, check if duplicate values are present Example: Input: /* * 10 * / \ * 8 10 * / \ / \ * 2 9 11 14 */…
Binary Tree: Given a binary tree, check if the tree is a children sum property
Problem Statement: Given a binary tree, check if the tree is a children sum property . Meaning, each root is a sum of its immediate two…
Binary Tree: Given a binary tree and a target, burn it
Problem Statement: Given a binary tree and a target, burn it. Below is the burning sequence. Fire will spread to the connected nodes. Each…