Good overview of how to solve these questions, but remember lesson 0 is always "Read the problem statement carefully."
If you can’t reach the given amount of money with any combination of the coins, you return -1.
There's no pennies here in Canada, so remove that from the denominations list and try to return 12 cents:
int main() { int denoms[3] = {25,10,5}; cout << countChange(denoms, 3, 12) << endl; }
$ ./countChange 0
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Good overview of how to solve these questions, but remember lesson 0 is always "Read the problem statement carefully."
There's no pennies here in Canada, so remove that from the denominations list and try to return 12 cents: