Which optimized DP pattern solves this lesson cleanly?

Question

Which optimized DP pattern solves this lesson cleanly?

Option A — Correct answer

Bottom-up DP where dp[value] is the fewest coins.

Option B

Plain recursion without caching

Option C

Two pointers on a sorted array

Option D

Stack matching only

Explanation

Bottom-up DP where dp[value] is the fewest coins.

Coin Change - Minimum Coins DP Pattern Practice Quiz