Coin change

Medium

Given an array of coin denominations and a total, find the minimum number of coins that it would take to make up the total.

For example, given the inputs

coins = [1, 2, 5]
total = 9

Your function should return 3 since you only need two 2 coins and one 5 coin to make the total 9.

(2 * 2) + (1 * 5) = 9

def coin_change(coins: list[int], total):
    # implement coin_change
    return -1

1def coin_change(coins: list[int], total):
2    # implement coin_change
3    return -1
4

Solution

Master Recursion & Dynamic Programming by trying the coding challenges below.

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.