Which optimized DP pattern solves this lesson cleanly?

Question

Which optimized DP pattern solves this lesson cleanly?

Option A — Correct answer

1D capacity DP with backward updates.

Option B

Plain recursion without caching

Option C

Two pointers on a sorted array

Option D

Stack matching only

Explanation

1D capacity DP with backward updates.

0/1 Knapsack - Capacity DP Pattern Practice Quiz