AppliedAIPrep logoAppliedAI/Prep
← Coding & DSA / 44
medium★ EssentialGoogleMetaAmazon

Coin Change: fewest coins to make an amount (unbounded knapsack DP).

The DP that exposes why greedy quietly breaks on non-standard denominations, and how one bottom-up table fixes it. The signal interviewers want is the dp[amount] recurrence and the unbounded-reuse insight.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

The DP that exposes why greedy quietly breaks on non-standard denominations, and how one bottom-up table fixes it. The signal interviewers want is the dp[amount] recurrence and the unbounded-reuse insight.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
Next in this trackLongest Common Subsequence (LCS) and the 2D DP family.Next in this trackGas Station: the greedy circuit problem.Next in this trackJump Game: can you reach the end of the array (greedy)?
DISCUSSION · 0

No comments yet — be the first to share your approach.