Sha256: a6caf6354fa668af50586dff0d6a990b6b966a7ec4c1bed3c15409c1fe25a294
Contents?: true
Size: 1.03 KB
Versions: 51
Compression:
Stored size: 1.03 KB
Contents
# Change Correctly determine the fewest number of coins to be given to a customer such that the sum of the coins' value would equal the correct amount of change. ## For example - An input of 15 with [1, 5, 10, 25, 100] should return one nickel (5) and one dime (10) or [0, 1, 1, 0, 0] - An input of 40 with [1, 5, 10, 25, 100] should return one nickel (5) and one dime (10) and one quarter (25) or [0, 1, 1, 1, 0] ## Edge cases - Does your algorithm work for any given set of coins? - Can you ask for negative change? - Can you ask for a change value smaller than the smallest coin value? To run the tests: ```sh $ gradle test ``` For more detailed info about the Java track see the [help page](http://exercism.io/languages/java). ## Source Software Craftsmanship - Kata-logue [http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata](http://craftsmanship.sv.cmu.edu/exercises/coin-change-kata) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
51 entries across 51 versions & 1 rubygems