Dynamic Programming

Break a problem into overlapping subproblems and reuse their answers instead of recomputing them.

  1. 01

    Ways to Climb Stairs

    • easy
  2. 02

    Cheapest Way Up

    • easy
    • Pro
  3. 03

    Rob the Street

    • medium
    • Pro
  4. 04

    Paths Through a Grid

    • medium
    • Pro
  5. 05

    Decode a Message

    • medium
    • Pro
  6. 06

    Fewest Coins for Change

    • medium
    • Pro
  7. 07

    Break into Words

    • medium
    • Pro
  8. 08

    Longest Increasing Subsequence

    • medium
    • Pro
  9. 09

    Longest Common Subsequence

    • hard
    • Pro
  10. 10

    Edit Distance

    • hard
    • Pro