Coin Change
Medium
Dynamic Programming
Given coin denominations and a total amount, print the fewest number of coins needed to make that amount, or -1 if it is impossible. Each coin may be used unlimited times.
Constraints
1 <= n <= 12 1 <= coin <= 2^31 - 1 0 <= amount <= 10^4
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.