medium10 pts · first answer countsdynamic-programmingcoin-changedebugging

Coin change when the amount cannot be made

In the fewest-coins DP for amount A, what is a safe way to handle amounts that cannot be made?

A.Fill with A + 1, return -1 if dp[A] is still A + 1B.Fill with 0 and return 0 when no coin combination fitsC.Fill with -1 and take the minimum of the options as usualD.Skip unreachable amounts and return dp[A] exactly as it is

Discussion 0

Join free to post in the discussion.

Coin change when the amount cannot be made

Discussion 0

Related questions