Dynamic Programming

Problems in this path

1. 01
   Climbing Stairs
   Easy · One-Dimensional DP
   Open
2. 02
   Maximum Non-Adjacent Sum
   Medium · Take or Skip DP
   Open
3. 03
   Minimum Coin Change
   Medium · Unbounded DP
   Open
4. 04
   Longest Increasing Subsequence
   Hard · DP + Binary Search
   Open
5. 05
   Edit Distance
   Hard · Two-Dimensional DP
   Open
6. 06
   0/1 Knapsack
   Medium · One-Dimensional Knapsack DP
   Open
7. 07
   Longest Common Subsequence
   Medium · Two-Sequence DP
   Open
8. 08
   Unique Grid Paths
   Easy · Grid DP
   Open
9. 09
   Partition Equal Subset Sum
   Medium · Subset-Sum DP
   Open
10. 10
    Word Break
    Medium · Prefix DP
    Open

Read first