For the “Coin Changing Problem” When the amount is 6, shouldn’t the number of ways be 6 not 5?
1.) 1,1,1,1,1,1
2.) 1,1,1,1,2
3.) 1,1,2,2
4.) 2,2,2
5.) 4,2
6.) 1,1,4
If the denominations you consider are [1,2,4] and amount to be 6, then the # of ways of reaching the amount is 6.
Could you please let me know where does the solution to the Coin change problem show the ways to be 5 instead of 6? Thanks.