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

  • Cyclone14089
     + 2 comments

    C++ solution :-

    long getWays(int n, vector<long> c) {
    if (n == 0)
        return 1;
        
    long arr[n + 1];
    for (int i = 0; i < n + 1; i++)
        arr[i] = 0;
    
    for (long coin: c)
        for (int i = 1; i < n + 1; i++) {
            if (coin < i)
                arr[i] += arr[i - coin];
            if (coin == i)
                arr[i]++;
        }
                
    return arr[n];
}

    Simplified implementation :-

    long getWays(int n, vector<long> c) {
    long arr[n + 1];
    for (int i = 0; i < n + 1; i++)
        arr[i] = 0;
		arr[0] = 1;
    
    for (long coin: c)
        for (int i = 1; i < n + 1; i++)
            if (coin <= i)
                arr[i] += arr[i - coin];
                
    return arr[n];
}