| 1. Print Numbers from 1 to N | Recursion | 75.00% | | Easy |
| 2. Print Number From N to 1 | Recursion | 80.00% | | Easy |
| 3. 2Sum - Pair With Given Sum | Array Hashing Hashmap | 30.61% | | Easy |
| 4. Sum Of First N Natural Numbers | Recursion | 60.00% | | Easy |
| 5. Largest subarray of 0's and 1's | Data Structures Basics | 50.00% | | Easy |
| 6. Max of min for every window | Stack | 50.00% | | Hard |
| 7. Maximum fruit gathering by birds | Array | 50.00% | | Easy |
| 8. Sum of elements of smallest subarray greater than x | Array | 50.00% | | Easy |
| 9. Length of the longest substring | String | 50.00% | | Medium |
| 10. Smallest Window of All Characters | String Dynamic Programming | 50.00% | | Hard |
| 11. Equal Sum Subarrays | Queue | 50.00% | | Easy |
| 12. Ways to Reaching the n'th Stair | Dynamic Programming | 50.00% | | Medium |
| 13. Implement Min Stack | Stack | 22.59% | | Medium |
| 14. First non-repeating in a stream | Queue | 31.65% | | Medium |
| 15. Binary Heap Operations | Heap | 22.30% | | Medium |
| 16. Detect Loop in linked list | Linked List | 43.49% | | Medium |
| 17. Palindrome Linked List | Linked List | 41.48% | | Medium |
| 18. Categorize even and odd nodes in a Linked List | Linked List | 49.80% | | Medium |
| 19. Check for balanced Paranthesis | Stack | 28.56% | | Easy |
| 20. Asteroid Collision | Stack | 50.06% | | Medium |
| 21. Convert Infix To Prefix Notation | Stack | 52.94% | | Medium |
| 22. Histogram Max Rectangular Area | Stack | 32.12% | | Hard |
| 23. Implement Queue using Arrays | Queue | 47.24% | | Basic |
| 24. Minimum Cost of Ropes | Queue | 42.73% | | Medium |
| 25. Heap Sort | Heap | 53.06% | | Medium |
| 26. Word Search | Recursion | 32.69% | | Medium |
| 27. Print Pattern | Recursion | 56.39% | | Easy |
| 28. Floor in a Sorted Array | Sorting Algorithms | 33.75% | | Easy |
| 29. Minimum sum | Array Sorting Algorithms | 17.14% | | Medium |
| 30. Number of Pairs | Array | 21.82% | | Medium |
| 31. Find Transition Point | Array Searching Algorithms | 37.90% | | Easy |
| 32. Super Primes | Searching Algorithms | 24.90% | | Medium |
| 33. Pair Sum Closest to 0 | Searching Algorithms | 19.61% | | Easy |
| 34. Bitonic Point | Searching Algorithm | 58.67% | | Easy |
| 35. Alien Dictionary | String | 47.81% | | Hard |
| 36. Find the String | String | 72.98% | | Hard |
| 37. Lowest Common Ancestor of a Binary Tree | Tree | 50.00% | | Medium |
| 38. Binary Tree Maximum Path Sum | Tree | 50.00% | | Hard |
| 39. 0-1 Knapsack Problem | Array Dynamic Programming | 50.00% | | Medium |
| 40. Rod Cutting | Array Dynamic Programming | 50.00% | | Medium |
| 41. Stock buy and sell | Array Dynamic Programming | 29.18% | | Medium |
| 42. Maximum Meetings in One Room | Array Sorting Algorithms | 33.57% | | Medium |
| 43. Subset Sums | Recursion | 72.55% | | Medium |
| 44. Game with String | Heap | 53.96% | | Medium |
| 45. Interleave the First Half of the Queue with Second Half | Queue | 69.35% | | Medium |
| 46. Merge Sort for Linked List | Linked List | 74.76% | | Medium |
| 47. Reverse a Linked List in Groups | Linked List | 57.08% | | Medium |
| 48. Intersection of Two Linked Lists | Linked List | 35.30% | | Easy |
| 49. Reverse Words In A String | String | 47.80% | | Easy |
| 50. First Occurrence In A String | String | 50.08% | | Medium |
| 51. Distinct Paths II | Array Recursion Dynamic Programming 2D Array | 50.00% | | Medium |
| 52. Minimum Path Sum | Array Dynamic Programming 2D Array | 50.00% | | Medium |
| 53. Distinct Paths | Array Recursion Dynamic Programming 2D Array | 50.00% | | Medium |
| 54. Longest Increasing Subsequence | Array Dynamic Programming | 20.00% | | Medium |
| 55. Longest Common Subsequence | Array String Dynamic Programming | 50.00% | | Medium |
| 56. Number of Turns in Binary Tree | Tree | 50.00% | | Hard |
| 57. Find Largest Value in Each Tree Row | Tree | 50.00% | | Medium |
| 58. Tree Path Sum | Tree | 50.00% | | Medium |
| 59. Cake Distribution Problem | Array Searching Algorithms | 64.62% | | Hard |
| 60. Level Order Traversal of Binary Tree | Tree | 50.00% | | Medium |
| 61. Inorder Traversal Of Binary Tree | Tree | 50.00% | | Easy |
| 62. Preorder Traversal Of Binary Tree | Tree | 50.00% | | Easy |
| 63. Postorder Traversal Of Binary Tree | Tree | 50.00% | | Easy |
| 64. Height of Binary Tree | Tree | 50.00% | | Easy |
| 65. Same Binary Tree | Tree | 50.00% | | Easy |
| 66. Maximum Width of Binary Tree | Tree | 50.00% | | Easy |
| 67. Mirror Binary Tree | Tree | 50.00% | | Easy |
| 68. Search Insert Position | Array Sorting Algorithms | 48.03% | | Easy |
| 69. 3 Sum | Array Sorting Algorithm | 35.80% | | Medium |
| 70. K-Pangrams | String Hashing | 20.91% | | Medium |
| 71. Winner of an election | String Hashing | 53.75% | | Easy |
| 72. Making A Large Island | Graph BFS DFS | 52.36% | | Hard |
| 73. Stepping Numbers | BFS DFS | 48.44% | | Medium |
| 74. Course Schedule | Graph BFS DFS | 51.77% | | Medium |
| 75. You and your books | Array Dynamic Programming | 50.00% | | Easy |
| 76. Maximize dot product | Dynamic Programming | 13.27% | | Medium |
| 77. Next Smallest Palindrome | Array | 19.63% | | Hard |
| 78. Count Smaller elements | Array | 38.16% | | Hard |
| 79. Redundant Parenthesis | String Stack | 51.49% | | Hard |
| 80. Smallest factorial number | Searching Algorithms | 38.79% | | Medium |
| 81. Insertion Sort | Sorting Algorithms | 66.61% | | Easy |
| 82. Quick Sort | Sorting Algorithms | 55.23% | | Medium |
| 83. Shop in Candy Store | Sorting Algorithms | 45.43% | | Easy |
| 84. Tower of Hanoi | Recursion | 35.23% | | Medium |
| 85. Power Of Numbers | Recursion | 20.22% | | Medium |
| 86. Kth largest element | Heap | 64.92% | | Medium |
| 87. Sort a stack | Recursion | 69.19% | | Medium |
| 88. Reverse First K elements of Queue | Queue | 81.28% | | Medium |
| 89. Queue using Linked List | Queue | 45.60% | | Easy |
| 90. Number of NGEs to the right | Stack | 56.74% | | Medium |
| 91. Implement Stack using Linked List | Stack | 53.98% | | Easy |
| 92. Implement Stack Using Array | Stack | 54.76% | | Basic |
| 93. Flattening a Linked List | Linked List | 51.53% | | Medium |
| 94. Kth from End of Linked List | Linked List | 47.30% | | Medium |
| 95. Merge Two Sorted Lists | Linked List | 65.70% | | Medium |
| 96. Reverse a Linked List | Linked List | 78.10% | | Easy |
| 97. Find Kth Rotation | Array Stack Searching Algorithm | 23.16% | | Easy |
| 98. Merge Sorted Arrays | Array Sorting Algorithms | 32.01% | | Easy |
| 99. Missing In Array | Array Searching Algorithms | 29.59% | | Easy |
| 100. Maximum Product Of Two Numbers | Array Sorting Algorithms | 81.34% | | Basic |
LEAD-ACE: EdTech Platform
600+ Quick notes
900+ Hands-on labs
50+ Real-world projects
45+ Interview books