| # | Title | Topics | Acceptance | Solution | Difficulty |
|---|---|---|---|---|---|
| 151 | Sum Of First N Natural Numbers | Recursion | 60.00% | Easy | |
| 152 | Largest subarray of 0's and 1's | Data Structures Basics | 50.00% | Easy | |
| 153 | Max of min for every window | Stack | 50.00% | Hard | |
| 154 | Maximum fruit gathering by birds | Array | 50.00% | Easy | |
| 155 | Sum of elements of smallest subarray greater than x | Array | 50.00% | Easy | |
| 156 | Length of the longest substring | String | 50.00% | Medium | |
| 157 | Smallest Window of All Characters | String Dynamic Programming | 50.00% | Hard | |
| 158 | Equal Sum Subarrays | Queue | 50.00% | Easy | |
| 159 | Ways to Reaching the n'th Stair | Dynamic Programming | 50.00% | Medium | |
| 160 | Implement Min Stack | Stack | 22.59% | Medium | |
| 161 | First non-repeating in a stream | Queue | 31.65% | Medium | |
| 162 | Binary Heap Operations | Heap | 22.30% | Medium | |
| 163 | Detect Loop in linked list | Linked List | 43.49% | Medium | |
| 164 | Palindrome Linked List | Linked List | 41.48% | Medium | |
| 165 | Categorize even and odd nodes in a Linked List | Linked List | 49.80% | Medium | |
| 166 | Check for balanced Paranthesis | Stack | 28.56% | Easy | |
| 167 | Asteroid Collision | Stack | 50.06% | Medium | |
| 168 | Convert Infix To Prefix Notation | Stack | 52.94% | Medium | |
| 169 | Histogram Max Rectangular Area | Stack | 32.12% | Hard | |
| 170 | Implement Queue using Arrays | Queue | 47.24% | Basic | |
| 171 | Minimum Cost of Ropes | Queue | 42.73% | Medium | |
| 172 | Heap Sort | Heap | 53.06% | Medium | |
| 173 | Word Search | Recursion | 32.69% | Medium | |
| 174 | Print Pattern | Recursion | 56.39% | Easy | |
| 175 | Floor in a Sorted Array | Sorting Algorithms | 33.75% | Easy | |
| 176 | Minimum sum | Array Sorting Algorithms | 17.14% | Medium | |
| 177 | Number of Pairs | Array | 21.82% | Medium | |
| 178 | Find Transition Point | Array Searching Algorithms | 37.90% | Easy | |
| 179 | Super Primes | Searching Algorithms | 24.90% | Medium | |
| 180 | Pair Sum Closest to 0 | Searching Algorithms | 19.61% | Easy | |
| 181 | Bitonic Point | Searching Algorithm | 58.67% | Easy | |
| 182 | Alien Dictionary | String | 47.81% | Hard | |
| 183 | Find the String | String | 72.98% | Hard | |
| 184 | 0-1 Knapsack Problem | Array Dynamic Programming | 50.00% | Medium | |
| 185 | Rod Cutting | Array Dynamic Programming | 50.00% | Medium | |
| 186 | Stock buy and sell | Array Dynamic Programming | 29.18% | Medium | |
| 187 | Maximum Meetings in One Room | Array Sorting Algorithms | 33.57% | Medium | |
| 188 | Subset Sums | Recursion | 72.55% | Medium | |
| 189 | Interleave the First Half of the Queue with Second Half | Queue | 69.35% | Medium | |
| 190 | Merge Sort for Linked List | Linked List | 74.76% | Medium | |
| 191 | Reverse a Linked List in Groups | Linked List | 57.08% | Medium | |
| 192 | Intersection of Two Linked Lists | Linked List | 35.30% | Easy | |
| 193 | Reverse Words In A String | String | 47.80% | Easy | |
| 194 | First Occurrence In A String | String | 50.08% | Medium | |
| 195 | Distinct Paths II | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 196 | Minimum Path Sum | Array Dynamic Programming 2D Array | 50.00% | Medium | |
| 197 | Distinct Paths | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 198 | Longest Increasing Subsequence | Array Dynamic Programming | 20.00% | Medium | |
| 199 | Longest Common Subsequence | Array String Dynamic Programming | 50.00% | Medium | |
| 200 | Number of Turns in Binary Tree | Tree | 50.00% | Hard |
Structured learning, live mentorship and an integrated coding platform to help you land top software engineering roles.
Loading today’s challenge…
LEAD-ACE: EdTech Platform
600+ Quick notes
900+ Hands-on labs
50+ Real-world projects
45+ Interview books
