Skip to content

Conversation

erdenezul
Copy link

No description provided.

You have m types of coins available in infinite quantities
where the value of each coins is given in the array S=[S0,... Sm-1]
Can you determine number of ways of making change for n units using
the given types of coints?
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

*coints -> coins

@erdenezul
Copy link
Author

@harshildarji

@harshildarji harshildarji merged commit 21e8724 into TheAlgorithms:master Oct 30, 2017
@erdenezul erdenezul deleted the coin_change_problem branch October 30, 2017 12:07
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants