Dynamic Programming: Knapsack - 0/1 Knapsack Problem
Given the following partial dp table row for capacity w=0..5 after processing first two items:
w: 0 1 2 3 4 5
dp: [0, 0, 10, 10, 10, 20]
Weights: [2, 3], Values: [10, 20]
Which items were selected to achieve dp[5] = 20?
