Sha256: 2d3df2dc8a4e22906f22ce01d77b59b15cb3aef384a6ded8f1eb620fdcd01420
Contents?: true
Size: 612 Bytes
Versions: 84
Compression:
Stored size: 612 Bytes
Contents
Write a program that will 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
84 entries across 84 versions & 1 rubygems