Coin Change

article
12 min
1D DP Problems

Unlock this chapter

Access all lessons in 1D DP Problems

Cost: 5 credits · One-time unlock

Sign in to unlock with credits

Sign In

New users get 1,000 free credits

Dynamic Programming All →
DP Foundations
What is Dynamic Programming Memoization (Top-Down) Tabulation (Bottom-Up) Identifying DP Problems
1D DP Problems
Climbing Stairs House Robber Coin Change Longest Increasing Subsequence
2D DP Problems
Grid Paths Edit Distance Longest Common Subsequence Knapsack Problem
Previous
House Robber
Next
Longest Increasing Subsequence