Knapsack

Problems on the knapsack, including 0-1 knapsack, unbounded knapsack, subset sum, splitting items into two equal groups, coin change, and choosing items under several limits.

The introduction in the Dynamic programming section covers the method these problems use. Related problem sets are under Dynamic programming, Bitsets and Meet-in-the-middle.