Featured Lists Top 20 Problems on Dynamic programming Top 10 Problems on Backtracking Top 20 Problems on Graph Top 25 Problems on Trees Top 10 Problems on Bits Manipulation Top 15 Problems in LinkedList All Problems # Status Problem video Level Completes Likes 176 Find the Size of a Binary Tree without Recursion Beginner % 0 173 Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming) Hard % 0 172 Dynamic Programming - Longest Common Substring Medium % 0 171 Dynamic Programming - Longest Common Subsequence Medium % 0 167 Generate Well Ordered Passwords of a Given Length K Medium % 0 166 All N Length Strings from Given String of Length K Medium % 0 165 Generate all combinations of length N Hard % 0 164 Print All Possible Subsets with Sum equal to a given Number Hard % 0 162 Dynamic Programming - Subset Sum Problem Hard % 0 161 The Word Break Problem Hard % 0 159 Solve the Knight's Tour with Backtracking Hard % 0 158 Backtracking - Search a Word In a Matrix Hard % 0 157 Backtracking - N Queens Problem - Better Solution Hard % 0 156 Backtracking - N Queens Problem Hard % 0 155 Find the Kth Smallest/Largest Element in an Array Using Heap Beginner % 0 154 Priority Queue in Data Structure Beginner % 0 151 Breadth-First Search/Traversal in a Binary Tree Beginner % 0 150 Sort Names by their Last Names Beginner % 0 149 Backtracking - Rat In A Maze Puzzle Hard % 0 148 Solve Sudoku Puzzles with Backtracking Hard % 0 147 Introduction To Backtracking Programming Beginner % 0 143 Merge K Sorted Arrays Hard % 0 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 140 Rearrange Array Elements (A[i] = i) | In-place Approach Medium % 0 138 Find the Maximum Value in a Binary Tree Beginner % 0 137 Populate Next Right Pointers in Each Node Hard % 0 135 Find Paths with Sum in Binary Tree Medium % 0 133 Reverse Level Order Traversal of Binary Trees Medium % 0 131 Find the Height of a tree without using Recursion Medium % 0 130 Find and Print Full Nodes in a Binary Tree Beginner % 0 129 Binary Min-Max Heap Implementation Hard % 0 128 Magic Index - Find Index In Sorted Array Such That A[i] = i Beginner % 0 127 Numbers Palindrome in Both Decimal and Octal Beginner % 0 126 Generate All Permutations of a String (Well-Ordered) Medium % 0 125 Find the Increasing Triplet Sub-sequence in an array Medium % 0 Find the Size of a Binary Tree without Recursion Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming) Dynamic Programming - Longest Common Substring Dynamic Programming - Longest Common Subsequence Generate Well Ordered Passwords of a Given Length K All N Length Strings from Given String of Length K Generate all combinations of length N Print All Possible Subsets with Sum equal to a given Number Dynamic Programming - Subset Sum Problem The Word Break Problem Solve the Knight's Tour with Backtracking Backtracking - Search a Word In a Matrix Backtracking - N Queens Problem - Better Solution Backtracking - N Queens Problem Find the Kth Smallest/Largest Element in an Array Using Heap Priority Queue in Data Structure Breadth-First Search/Traversal in a Binary Tree Sort Names by their Last Names Backtracking - Rat In A Maze Puzzle Solve Sudoku Puzzles with Backtracking Introduction To Backtracking Programming Merge K Sorted Arrays Locate the Farthest Left Node on the Bottom Level Rearrange Array Elements (A[i] = i) | In-place Approach Find the Maximum Value in a Binary Tree Populate Next Right Pointers in Each Node Find Paths with Sum in Binary Tree Reverse Level Order Traversal of Binary Trees Find the Height of a tree without using Recursion Find and Print Full Nodes in a Binary Tree Binary Min-Max Heap Implementation Magic Index - Find Index In Sorted Array Such That A[i] = i Numbers Palindrome in Both Decimal and Octal Generate All Permutations of a String (Well-Ordered) Find the Increasing Triplet Sub-sequence in an array 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
