Coin Change

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins needed to make up that amount. If the amount cannot be made up by any combination of the coins, return -1. Assume an infinite number of each type of coin.

Constraints

  • 1 <= coins.length <= 12
  • 1 <= coins[i] <= 2^31 - 1
  • 0 <= amount <= 10^4
View editorial solution
Saving… · 2 lines
class Solution:
def coinChange(self, coins: List[int], amount: int) -> int:
Console

Click Run to execute sample tests.