# Status Problem Level Completes Likes 71 Print All Possible Subsets with Sum equal to a given Number Hard % 0 72 Dynamic Programming - Subset Sum Problem Hard % 0 73 The Word Break Problem Hard % 0 74 Backtracking - Knight's Tour Problem Hard % 0 75 Backtracking - Search a Word In a Matrix Hard % 0 76 Backtracking - N Queens Problem - Better Solution Hard % 0 77 Backtracking - N Queens Problem Hard % 0 78 Backtracking - Rat In A Maze Puzzle Hard % 0 79 Backtracking - SUDOKU Solver Hard % 0 80 Merge K Sorted Arrays Hard % 0 81 Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Hard % 0 82 Diameter Of a Binary Tree Hard % 1 83 Binary Min-Max Heap Implementation Hard % 0 84 Colorful Numbers Hard % 1 85 Print All the Subsets of a Given Set (Power Set) Hard % 1 86 Print All Combinations of subset of size K from Given Array Hard % 0 87 Print All Possible Valid Combinations Of Parenthesis of Given 'N' Hard % 1 88 AVL Tree - Insertion Hard % 0 89 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 90 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard % 0 91 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 92 Construct a Binary Tree from Given Inorder and Depth-First-Search. Hard % 0 93 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 94 Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space Hard % 0 95 Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number. Hard % 0 96 Print All The Nodes Which are X distance from the Given Node Hard % 0 97 Find the Distance between Two Nodes of a Binary Tree. Hard % 0 98 Construct a binary tree from given Inorder and Postorder Traversal Hard % 0 99 Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard % 0 100 Make a Binary Tree from Given Inorder and Preorder Traveral. Hard % 0 101 Print All The Permutations Of a String Hard % 0 102 Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern Hard % 0 103 Inorder Successor in Binary Search Tree without Using Parent link Hard % 0 104 Inorder Successor in Binary Search Tree Using Parent link Hard % 0 105 In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard % 0 Print All Possible Subsets with Sum equal to a given Number Dynamic Programming - Subset Sum Problem The Word Break Problem Backtracking - Knight's Tour Problem Backtracking - Search a Word In a Matrix Backtracking - N Queens Problem - Better Solution Backtracking - N Queens Problem Backtracking - Rat In A Maze Puzzle Backtracking - SUDOKU Solver Merge K Sorted Arrays Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Diameter Of a Binary Tree Binary Min-Max Heap Implementation Colorful Numbers Print All the Subsets of a Given Set (Power Set) Print All Combinations of subset of size K from Given Array Print All Possible Valid Combinations Of Parenthesis of Given 'N' AVL Tree - Insertion Construct a binary tree from given Inorder and Level Order Traversal Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Construct Binary Search Tree from a given Preorder Traversal using Recursion Construct a Binary Tree from Given Inorder and Depth-First-Search. Inorder Predecessor and Successor in Binary Search Tree Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number. Print All The Nodes Which are X distance from the Given Node Find the Distance between Two Nodes of a Binary Tree. Construct a binary tree from given Inorder and Postorder Traversal Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Make a Binary Tree from Given Inorder and Preorder Traveral. Print All The Permutations Of a String Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern Inorder Successor in Binary Search Tree without Using Parent link Inorder Successor in Binary Search Tree Using Parent link In a Binary Tree, Create Linked Lists of all the nodes at each depth. 1 2 3 4
