Sha256: 940cea464b06de6e25cd401550bfd080a7be4b68b6f5b9b640a476f02cafb41a
Contents?: true
Size: 659 Bytes
Versions: 6
Compression:
Stored size: 659 Bytes
Contents
Correctly determine change to be given using the least number of coins. 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
6 entries across 6 versions & 1 rubygems