0/1 knapsack, unbounded knapsack, and their disguises — subset sum, coin change, partition equal subset, target sum. Master the state definition, take/skip recurrence, and the 1D space optimization that makes these problems click permanently.
#dynamic-programming#knapsack#subset-sum
14 min