Sha256: 06a8aa2baedbc652045858d8683f387d096bf2cb64c685b1ad0caad4b0a5d7ce
Contents?: true
Size: 1.42 KB
Versions: 68
Compression:
Stored size: 1.42 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? ## Setup Go through the setup instructions for ECMAScript to install the necessary dependencies: http://exercism.io/languages/ecmascript ## Requirements Install assignment dependencies: ```bash $ npm install ``` ## Making the test suite pass Execute the tests with: ```bash $ npm test ``` In the test suites all tests but the first have been skipped. Once you get a test passing, you can enable the next one by changing `xtest` to `test`. ## Source Software Craftsmanship - Coin Change Kata [https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata](https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/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
68 entries across 68 versions & 1 rubygems