Solving coin change problem with limited coins.
Given an array of denominations and array Count , find minimum number of
coins required to form sum S.
for eg: coins[]={1,2,3};
count[]={1,1,3};
i.e we have 1 coin of 1$ , 1 coin of 2$ , 3 coins of 3$.
input S = 6
output = 2
possible combination : 3+3 = 6
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
