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