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