Coin Change Ways | Dataford Interview Questions

Number of ways to make change given coin values and a desired sum

Asked in the Technical phone screen stage. Given a list of distinct positive coin values and a non-negative desired sum, return the number of combinations that form the sum. Each coin can be used unlimited times, and different orders of the same coins count as one combination.

Input and Output

Implement def count_change(coins, amount):. Return an integer count. Return 1 when amount is 0, representing the empty combination.

Constraints

1 <= len(coins) <= 300
1 <= coins[i] <= 10,000
Coin values are distinct.
0 <= amount <= 10,000

Function Signature

def count_change(coins, amount):

Your question is Coin Change Ways. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem