Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Coin Change

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.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.