Sha256: dc1dd6d5906b6538deb3f6ef2e1d28dbde1e93911d4148873e7a2af6bf1d15b2
Contents?: true
Size: 586 Bytes
Versions: 90
Compression:
Stored size: 586 Bytes
Contents
Correctly determine the fewest number of coins to be given to the user 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?
Version data entries
90 entries across 90 versions & 1 rubygems