| # | Title | Topics | Acceptance | Solution | Difficulty |
|---|---|---|---|---|---|
| 1 | Game with String | Heap | 53.96% | Medium | |
| 2 | Kth largest element | Heap | 64.92% | Medium | |
| 3 | Min Number of Jumps | Dynamic Programming | 50.48% | Medium | |
| 4 | House Robber | Dynamic Programming | 51.45% | Medium | |
| 5 | Min Cost Climbing Stairs | Dynamic Programming | 65.21% | Easy | |
| 6 | Odd Even Graph Check | Graph | 63.45% | Medium | |
| 7 | Redundant Connection | Graph | 68.71% | Medium | |
| 8 | Detect Cycle in Undirected Graph (DFS) | Graph | 67.77% | Medium | |
| 9 | Path Existence Between Two Nodes | Graph | 80.12% | Easy | |
| 10 | Detect Cycle in Directed Graph (DFS) | Graph | 67.67% | Medium | |
| 11 | Level of Each Node | Graph | 74.21% | Medium | |
| 12 | BFS Traversal | Graph | 83.12% | Easy | |
| 13 | DFS Traversal | Graph DFS Traversal | 85.64% | Easy | |
| 14 | Flood Fill | Recursion | 69.00% | Medium | |
| 15 | Number of Islands | Recursion | 66.00% | Medium | |
| 16 | Remove Duplicates From A String | String Stack | 61.68% | Easy | |
| 17 | Remove Consecutive Duplicates | Recursion | 60.00% | Easy | |
| 18 | Find Element in a Sorted Array | Binary Search | 80.00% | Easy | |
| 19 | Binary Tree Cameras | Tree Traversal Binary Tree | 55.21% | Hard | |
| 20 | Boundary Traversal | Tree Traversal Binary Tree | 45.21% | Hard | |
| 21 | Compare Leaf Traversal | Tree Traversal Binary Tree | 77.95% | Medium | |
| 22 | Binary Tree Post Order Traversal | Tree Recursion Traversal Binary Tree | 79.59% | Easy | |
| 23 | Inorder Successor in BST | Tree Traversal Binary Tree | 60.12% | Medium | |
| 24 | Kth Largest Element in BST | Tree Traversal Binary Tree | 70.53% | Medium | |
| 25 | Construct Tree from Inorder + Postorder | Tree Traversal Binary Tree | 65.12% | Medium | |
| 26 | Top View of Binary Tree | Tree Traversal Binary Tree | 60.21% | Medium | |
| 27 | Convert Sorted Array to BST | Tree Traversal Binary Tree | 74.56% | Medium | |
| 28 | Find Maximum in BST | Tree Traversal Binary Tree | 85.54% | Easy | |
| 29 | Find Minimum in BST | Tree Traversal Binary Tree | 85.18% | Easy | |
| 30 | Find Distance Between Two Nodes | Tree Traversal Binary Tree | 62.45% | Medium | |
| 31 | All Paths With Given Sum | Tree Traversal Binary Tree | 74.23% | Medium | |
| 32 | Maximum Root to Leaf Path Sum | Tree Traversal Binary Tree | 72.15% | Medium | |
| 33 | Count Non-Leaf Nodes In Binary Tree | Tree Traversal Binary Tree | 60.48% | Easy | |
| 34 | Minimum Depth of Binary Tree | Tree Traversal Binary Tree | 60.25% | Medium | |
| 35 | Construct Tree from Inorder + Preorder | Tree Traversal Binary Tree | 70.00% | Medium | |
| 36 | Right View of Binary Tree | Tree Traversal Binary Tree | 74.36% | Medium | |
| 37 | Lowest Common Ancestor in BST | Tree Traversal Binary Tree | 70.50% | Medium | |
| 38 | Kth Smallest Element in BST | Tree Traversal Binary Tree | 76.77% | Medium | |
| 39 | Maximum Path Sum in Binary Tree | Tree Traversal Binary Tree | 58.59% | Hard | |
| 40 | Delete Node In BST | Tree Traversal Binary Tree | 65.20% | Medium | |
| 41 | Validate BST | Tree Traversal Binary Tree | 45.23% | Medium | |
| 42 | Search / Insert into BST | Tree Traversal Binary Tree | 89.54% | Easy | |
| 43 | Find Nodes at Distance K from Given Node | Tree Traversal Binary Tree | 65.95% | Hard | |
| 44 | Lowest Common Ancestor of Binary Tree | Tree Traversal Binary Tree | 78.59% | Medium | |
| 45 | Print All Root To Leaf Paths | Tree Traversal Binary Tree | 68.59% | Hard | |
| 46 | Root To Leaf Path Sum | Tree Traversal Binary Tree | 78.56% | Medium | |
| 47 | Diameter of Binary Tree | Tree Traversal Binary Tree | 73.45% | Medium | |
| 48 | Check Binary Tree Is Balanced | Tree Traversal Binary Tree | 78.95% | Medium | |
| 49 | Check if Tree is Symmetric | Tree Traversal Binary Tree | 74.98% | Medium | |
| 50 | Check if Two Trees are Identical | Tree Traversal Binary Tree | 76.59% | Medium |
Loading today’s challenge…