Coin Changing Problem

Given available coin denominations, find the number​ of ways to make the change for a given amount of money.


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.


Suppose the available coin denominations are 11, 22 and 55 and the total amount of money is 77. We can make the change for 77 in the following six ways:

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.