Coin Changing Problem
Given available coin denominations, find the number of ways to make the change for a given amount of money.
Statement
Given an integer array representing coins of different denominations and an integer amount representing a total amount of money, return the number of ways the coins can sum up to the amount.
There is no limit on the number of coins available to you.
Example
Suppose the available coin denominations are , and and the total amount of money is . We can make the change for in the following six ways:
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.