Last active
June 17, 2021 13:12
-
-
Save furf/5609175 to your computer and use it in GitHub Desktop.
Given a set of coin denominators, find the minimum number of coins to give a certain amount of change.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function makeChange (amount) { | |
| var change = {}, | |
| i = 0, | |
| coins = makeChange.COINS, | |
| coin; | |
| while (amount && (coin = coins[i++])) { | |
| if (amount >= coin) { | |
| change[coin] = ~~(amount / coin); | |
| amount %= coin; | |
| } | |
| } | |
| return change; | |
| } | |
| makeChange.COINS = [100, 25, 10, 5, 1]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| makeChange(199); // {1: 4, 10: 2, 25: 3, 100: 1} |
Good catch. My solution was overly simplistic. I'll need to go back and look at it. Thanks!
@furf no problem! We're using this as an interview question (ours accepts dynamic denominations as well) and I know there's several ways to go about doing this, so i was looking around
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Fails for some sets of coin denominations
as you can see, the result should be
{ 8: 2 }