Skip to content

Commit e707605

Browse files
committed
Added description to coin change problem
Added a readme.md file to the coin change problem
1 parent e8f615c commit e707605

File tree

1 file changed

+7
-0
lines changed

1 file changed

+7
-0
lines changed

DP/Coin Change Problem/README.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
# Coin Change Problem
2+
3+
Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter.
4+
5+
For example, for N = 4 and S = {1,2,3}, there are four solutions: {1,1,1,1},{1,1,2},{2,2},{1,3}. So output should be 4. For N = 10 and S = {2, 5, 3, 6}, there are five solutions: {2,2,2,2,2}, {2,2,3,3}, {2,2,6}, {2,3,5} and {5,5}. So the output should be 5.
6+
7+
Description pulled from [Geeksforgeeks.org](https://www.geeksforgeeks.org/coin-change-dp-7/)

0 commit comments

Comments
 (0)