Coin Change
Using unlimited copies of each positive coin denomination, return the fewest coins summing exactly to amount. Return -1 if impossible, and zero for amount zero.
Example 1
coins = [2,3,7]
amount = 113Explanation
7+2+2 uses three coins; no one- or two-coin combination reaches 11.
Example 2
coins = [4]
amount = 6-1Explanation
Coins worth 4 only produce multiples of 4, never 6.
Example 3
coins = [5]
amount = 00Explanation
Amount zero requires no coins.
Constraints
- 1 <= number of distinct coins <= 12
- 0 <= amount <= 10000
- Coin values are positive signed 32-bit integers
Function contract
coinChangeArguments: json, jsonSolutionRuns on your device
Loading draft…
Run: 3 examples; Submit: 35 cases, on your device.
[2,3,7]11