0
I m solving the coin change problem having target of n and upper bound as n.
Also the maximum number of coins is 10.
So for an example if the target is 11 then the possible outcomes are -
11
10,1
9,2
9,1,1
....
....
....
2,1,1,1,1,1,1,1,1,1
So the last iteration having eleven 1's are not all...