dynamic_programming.minimum_coin_change

You have m types of coins available in infinite quantities where the value of each coins is given in the array S=[S0,… Sm-1] Can you determine number of ways of making change for n units using the given types of coins? https://www.hackerrank.com/challenges/coin-change/problem

Functions

dp_count(s, n)

Module Contents

dynamic_programming.minimum_coin_change.dp_count(s, n)

>>> dp_count([1, 2, 3], 4)
4
>>> dp_count([1, 2, 3], 7)
8
>>> dp_count([2, 5, 3, 6], 10)
5
>>> dp_count([10], 99)
0
>>> dp_count([4, 5, 6], 0)
1
>>> dp_count([1, 2, 3], -5)
0