Look at what you can do now:
Solve 0/1 knapsack with the two-dimensional DP pattern
Swap dimensions when weights are too large (value-based DP)
Simplify to one dimension when items can repeat (unbounded)
Recognize knapsack structure in disguised problems The knapsack pattern appears everywhere: subset sums, resource allocation, partition problems, coin counting. When you see "choose items under a limit," you now know exactly how to approach it. Next section, you'll see how prefix sums can speed up certain DP transitions. But first, solve those practice problems. The pattern only sticks with repetition.