Leetcode Problem 322. Coin Change

322. Coin Change

Leetcode Solutions

Initialize an array dp of size amount + 1 and fill it with amount + 1. This represents the minimum number of coins needed for each amount from 0 to amount.
Set dp[0] to 0.
Loop over the range from 1 to amount (inclusive), calling each value i.
For each i, loop over each coin in coins.
If the coin value is less than or equal to i, set dp[i] to the minimum of dp[i] and dp[i - coin] + 1.
After filling the dp table, check if dp[amount] is greater than amount. If so, return -1.
Otherwise, return dp[amount].

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen