Coin Change
Updated Jan 31, 2026
Problem
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 that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.
You may assume that you have an infinite number of each kind of coin.
Constraints
1 <= coins.length <= 12
1 <= coins[i] <= 2^31 - 1
0 <= amount <= 10^4
Examples
Example 1
Input:
coins = [1,2,5], amount = 11
Output:
3
11 = 5 + 5 + 1
Example 2
Input:
coins = [2], amount = 3
Output:
-1
Example 3
Input:
coins = [1], amount = 0
Output:
0
Function Signature
def coinChange(self, coins: list[int], amount: int) -> int
How to Submit
Implement a Solution class with a coinChange method.
Your method will be called with the input parameters and should return the answer.