Opening page…
Break a problem into overlapping subproblems, define a state, and build answers from smaller ones.
Solved
| Solved | # | Problem | Pattern | Level | Preview |
|---|---|---|---|---|---|
| 1 | Climbing Stairs | 1D DP · fibonacci | Easy | ||
| 2 | Min Cost Climbing Stairs | 1D DP | Easy | ||
| 3 | N-th Tribonacci Number | 1D DP | Easy | ||
| 4 | House Robber | 1D DP | Medium | ||
| 5 | Decode Ways | 1D DP · string | Medium | ||
| 6 | Word Break | 1D DP · string | Medium | ||
| 7 | Coin Change | unbounded knapsack | Medium | ||
| 8 | Coin Change II | unbounded knapsack · counting | Medium | ||
| 9 | Partition Equal Subset Sum | 0/1 knapsack | Medium | ||
| 10 | Target Sum | 0/1 knapsack · counting | Medium |
Showing 1–10 of 18 problems