Dynamic Programming: Knapsack - Subset Sum
Given the following partial dp array after processing the first 3 items of nums = [3, 4, 5, 6] with target sum S=10:
dp = [True, False, False, True, True, True, False, False, False, False, False]
Which of the first three items was definitely included to achieve dp[3] = True?
