DSA icon indicating copy to clipboard operation
DSA copied to clipboard
verified publisher icon arnab2001

Coin change Dynamic programming problem

Open coding-geek21 opened this issue 4 years ago • 2 comments

Given a value N, if we want to make change for N cents, and we have a supply of each of C = { C1, C2, .. , Cm} valued coins, how many ways can we make the change if the order of coins doesn’t matter.

coding-geek21 avatar Oct 01 '21 14:10 coding-geek21

I would like to work on this in C++. Will you please assign it to me?

lucy2512 avatar Oct 02 '21 02:10 lucy2512

Given a value N, if we want to make change for N cents, and we have a supply of each of C = { C1, C2, .. , Cm} valued coins, how many ways can we make the change if the order of coins doesn’t matter.

I can provide its solution in Java.. can you assign me this?

culeAkash avatar Oct 03 '21 01:10 culeAkash