Solution: Coin Change
Explore the dynamic programming solution to the coin change problem by understanding how to minimize coin usage for a target amount. Learn to apply top-down memoization to optimize subproblem solving and improve time complexity over naive recursive approaches.
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] -
...