Dynamic Programming #01
Medium Coin Change
Compute the fewest reusable coins needed to reach the target amount, or report that it is impossible.
Solved dynamic programmingunbounded knapsackminimum transitions
Dynamic Programming
State design, transition choices, and subproblem reuse without overcomplicating the implementation. The focus here is state compression and transition design. Official LeetCode problems are linked on every page instead of being mirrored here.
1 published solutions
3 distinct tags
0 easy / 1 medium / 0 hard difficulty mix
May 21, 2026 most recently updated page
Problems
Published pages in this category
Every page keeps the problem summary, recognition pattern, reasoning, pitfalls, and the exact C++ source used on the site.