1 parent 96536ad commit 53ce9b8Copy full SHA for 53ce9b8
1 file changed
dynamic_programming/coin_change.py
@@ -2,7 +2,7 @@
2
You have m types of coins available in infinite quantities
3
where the value of each coins is given in the array S=[S0,... Sm-1]
4
Can you determine number of ways of making change for n units using
5
-the given types of coints?
+the given types of coins?
6
https://www.hackerrank.com/challenges/coin-change/problem
7
"""
8
def dp_count(S, m, n):
0 commit comments