| # | Title | Topics | Acceptance | Solution | Difficulty |
|---|---|---|---|---|---|
| 1 | Smallest Window of All Characters | String Dynamic Programming | 50.00% | Hard | |
| 2 | Ways to Reaching the n'th Stair | Dynamic Programming | 50.00% | Medium | |
| 3 | 0-1 Knapsack Problem | Array Dynamic Programming | 50.00% | Medium | |
| 4 | Rod Cutting | Array Dynamic Programming | 50.00% | Medium | |
| 5 | Stock buy and sell | Array Dynamic Programming | 29.18% | Medium | |
| 6 | Distinct Paths II | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 7 | Minimum Path Sum | Array Dynamic Programming 2D Array | 50.00% | Medium | |
| 8 | Distinct Paths | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 9 | Longest Increasing Subsequence | Array Dynamic Programming | 20.00% | Medium | |
| 10 | Longest Common Subsequence | Array String Dynamic Programming | 50.00% | Medium | |
| 11 | You and your books | Array Dynamic Programming | 50.00% | Easy | |
| 12 | Maximize dot product | Dynamic Programming | 13.27% | Medium |
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
