We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. The Coin Change Problem
  5. Discussions

The Coin Change Problem

  • harsh_k_arora
     + 0 comments
    def getWays(n, c):
    count = [0]*(n+1)
    count[0] = 1
    c.sort(reverse = True) 
    for coin in c:
        for i in range(coin, n +1):
            count[i] += count[i-coin]
    return count[n]

    sorting is done in order to understand how denomination is formed

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in