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