Solution: Coin Change
Explore a dynamic programming approach to solve the coin change problem by breaking it down into subproblems. Understand why a greedy method fails and how memoization improves efficiency. Learn to implement a top-down solution that calculates the fewest coins needed to reach a target amount, considering all coin denominations.
Statement
Given an integer total that represents the target amount of money and a list of integers coins that represents different coin denominations, find the minimum number of coins required to make up the total amount. If it’s impossible to achieve the target amount using the given coins, return -1. If the target amount is 0, return 0.
Note: You can assume that we have an infinite number of each kind of coin.
Constraints:
-
coins.length -
coins[i] -
...