Skip to main content

🎮 Dynamic Programming (Practice)

Companion to the Dynamic Programming guide. Watch the DP table fill bottom-up for coin change, then implement it.

🎬 Watch it work​

Coin Change — dp[a] = fewest coins for amount aStep 1 / 13
0
0
0
0
0
0
0
0
0
0
0
0
dp[a] = min coins to make amount a. dp[0]=0.

🐍 Your turn​

Loading editor…

🧠 Challenge yourself​

  1. Return the actual coins used, not just the count.
  2. Count the number of ways to make the amount (combinations).
  3. Turn the 0/1 knapsack into a similar table — what changes?

Continue the path → Graph Theory