| # | Title | Topics | Acceptance | Solution | Difficulty |
|---|---|---|---|---|---|
| 1 | 0-1 Knapsack Problem | Array Dynamic Programming | 50.00% | Medium | |
| 2 | 2Sum - Pair With Given Sum | Array Hashing Hashmap | 30.61% | Easy | |
| 3 | 3 Sum | Array Sorting Algorithm | 35.80% | Medium | |
| 4 | Aggressive Cows | Binary Search | 70.00% | Medium | |
| 5 | Alien Dictionary | String | 47.81% | Hard | |
| 6 | All Occurrence Of An Element | Recursion | 59.00% | Easy | |
| 7 | All Paths With Given Sum | Tree Traversal Binary Tree | 74.23% | Medium | |
| 8 | Allocate Minimum Pages | Binary Search | 62.00% | Medium | |
| 9 | Asteroid Collision | Stack | 50.06% | Medium | |
| 10 | BFS Traversal | Graph | 83.12% | Easy | |
| 11 | Binary Heap Operations | Heap | 22.30% | Medium | |
| 12 | Binary Search (Iterative) | Binary Search | 79.00% | Easy | |
| 13 | Binary Tree Cameras | Tree Traversal Binary Tree | 55.21% | Hard | |
| 14 | Binary Tree Inorder Traversal | Recursion Trees Traversal Binary Tree | 75.68% | Easy | |
| 15 | Binary Tree Level Order Traversal | Tree Recursion Traversal Binary Tree | 79.68% | Easy | |
| 16 | Binary Tree Post Order Traversal | Tree Recursion Traversal Binary Tree | 79.59% | Easy | |
| 17 | Binary Tree Preorder Traversal | Tree Recursion Binary Tree | 79.85% | Easy | |
| 18 | Binary Tree Zigzag Level Order Traversal | Tree Recursion Traversal Binary Tree | 71.48% | Medium | |
| 19 | Bitonic Point | Searching Algorithm | 58.67% | Easy | |
| 20 | Boundary Traversal | Tree Traversal Binary Tree | 45.21% | Hard | |
| 21 | Cake Distribution Problem | Array Searching Algorithms | 64.62% | Hard | |
| 22 | Capacity To Ship Packages Within D Days | Binary Search | 65.00% | Medium | |
| 23 | Categorize even and odd nodes in a Linked List | Linked List | 49.80% | Medium | |
| 24 | Check Array is Sorted | Recursion | 80.00% | Basic | |
| 25 | Check Binary Tree Is Balanced | Tree Traversal Binary Tree | 78.95% | Medium | |
| 26 | Check for balanced Paranthesis | Stack | 28.56% | Easy | |
| 27 | Check if Binary Tree is Balanced | Recursion | 77.00% | Medium | |
| 28 | Check if Element Exists | Binary Search | 87.00% | Easy | |
| 29 | Check if Linked List is Palindrome | Linked List | 67.00% | Medium | |
| 30 | Check if Tree is Symmetric | Tree Traversal Binary Tree | 74.98% | Medium | |
| 31 | Check if Two Trees are Identical | Tree Traversal Binary Tree | 76.59% | Medium | |
| 32 | Check Palindrome | Recursion | 90.00% | Easy | |
| 33 | Check String Is Subsequence To Another | Recursion | 75.00% | Medium | |
| 34 | Combination Sum | Recursion | 75.00% | Medium | |
| 35 | Combination Sum II | Recursion | 76.00% | Medium | |
| 36 | Compare Leaf Traversal | Tree Traversal Binary Tree | 77.95% | Medium | |
| 37 | Construct Tree from Inorder + Postorder | Tree Traversal Binary Tree | 65.12% | Medium | |
| 38 | Construct Tree from Inorder + Preorder | Tree Traversal Binary Tree | 70.00% | Medium | |
| 39 | Convert Infix To Prefix Notation | Stack | 52.94% | Medium | |
| 40 | Convert Sorted Array to BST | Tree Traversal Binary Tree | 74.56% | Medium | |
| 41 | Convert String to Integer | Recursion | 60.00% | Medium | |
| 42 | Count Binary Strings | Recursion | 60.00% | Medium | |
| 43 | Count Characters | Recursion | 85.00% | Easy | |
| 44 | Count Inversions | Array Sorting Algorithms | 16.93% | Medium | |
| 45 | Count Leaf Nodes In Binary Tree | Tree Traversal Binary Tree | 74.59% | Medium | |
| 46 | Count Nodes in Binary Tree | Recursion | 64.00% | Medium | |
| 47 | Count Non-Leaf Nodes In Binary Tree | Tree Traversal Binary Tree | 60.48% | Easy | |
| 48 | Count Smaller elements | Array | 38.16% | Hard | |
| 49 | Count Total Nodes in Binary Tree | Tree Traversal Binary Tree | 75.68% | Medium | |
| 50 | Count Ways To Reach Nth Stair | Recursion | 60.00% | Medium |
Loading today’s challenge…