Coin Change

You are given a list coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. Each coin can be used any number of times. If amount cannot be made up by any combination of the coins, return -1.

Example 1:

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

Output: 3

Explanation:

11 = 5 + 5 + 1, minimum of 3 total coins used

Example 2:

Input: coins = [3], amount = 1

Output: -1

Try it yourself


🪄