Coin Change · Coding Interview Practice

Coin ChangeGiven coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if impossible.Constraints

1 <= coins.length <= 12

1 <= coins[i] <= 2^31 - 1

0 <= amount <= 10^4

Examples

Input: coins = [1,2,5], amount = 11 Output: 3

Input: coins = [2], amount = 3 Output: -1

LetsDiscuss

Loading your session…