tag:blogger.com,1999:blog-3418265334198879901.post7243924139869634764..comments2015-07-08T20:12:23.530+05:30Comments on Coders Stop: A closer look at Coin ChangeAviral Guptahttps://plus.google.com/106672188404614095306noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-3418265334198879901.post-28971449313816987722013-10-23T12:19:09.476+05:302013-10-23T12:19:09.476+05:30The problem statement clearly states that "th...The problem statement clearly states that "the order does not matter".<br />There is a easy modification which can be done if you wish to calculate only the unique combinations.<br />For the above example the number of ways to have a sum of 4 with the give coins of 1, 2, 3 is 4 ways = {1,1,1,1},{1,1,2}, {2,2},{1,3}.Aviral Guptahttps://www.blogger.com/profile/11920144614598355124noreply@blogger.comtag:blogger.com,1999:blog-3418265334198879901.post-66960071974819323902013-10-23T01:16:09.079+05:302013-10-23T01:16:09.079+05:30In the example that you've provided how come c...In the example that you've provided how come coming up with sum 7 is different between 1,1,2 and 1,2,1 (and other permutations as well)Anonymousnoreply@blogger.com