The main difference between the standard CC algo, and the one with limited
coin supply is the maximum value that we can form with the given coins.
For example :
In stranded CC
coins = {1,2,3}
then we can can form denominations to any value(assuming that coin with 1
value will always be there).
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 com
