Coin Change
Last updated
What is Coin Change?
Given coin denominations and a target amount, find the minimum number of coins needed. You build a DP table where each amount stores the fewest coins to make it, using each coin to update future amounts. This is the canonical unbounded knapsack problem and teaches you bottom-up DP where you iterate over amounts rather than items.
Free resources to learn Coin Change
More in stage 16: D Dynamic Programming
Coin Change: common questions
Can I learn Coin Change in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Coin Change in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Coin Change tutorial for beginners?
It is lesson 99 of 137 in the free LeetCode roadmap, in stage 16, D Dynamic Programming. If you are new to LeetCode, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.