| # | Title | Topics | Acceptance | Solution | Difficulty |
|---|---|---|---|---|---|
| 1 | Min Number of Jumps | Dynamic Programming | 50.48% | Medium | |
| 2 | House Robber | Dynamic Programming | 51.45% | Medium | |
| 3 | Min Cost Climbing Stairs | Dynamic Programming | 65.21% | Easy | |
| 4 | Smallest Window of All Characters | String Dynamic Programming | 50.00% | Hard | |
| 5 | Ways to Reaching the n'th Stair | Dynamic Programming | 50.00% | Medium | |
| 6 | 0-1 Knapsack Problem | Array Dynamic Programming | 50.00% | Medium | |
| 7 | Rod Cutting | Array Dynamic Programming | 50.00% | Medium | |
| 8 | Stock buy and sell | Array Dynamic Programming | 29.18% | Medium | |
| 9 | Distinct Paths II | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 10 | Minimum Path Sum | Array Dynamic Programming 2D Array | 50.00% | Medium | |
| 11 | Distinct Paths | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 12 | Longest Increasing Subsequence | Array Dynamic Programming | 20.00% | Medium | |
| 13 | Longest Common Subsequence | Array String Dynamic Programming | 50.00% | Medium | |
| 14 | You and your books | Array Dynamic Programming | 50.00% | Easy | |
| 15 | Maximize dot product | Dynamic Programming | 13.27% | Medium |
Loading today’s challenge…