Many problems choose items under a limit to get the best total, like picking projects within a budget. In 0/1 knapsack each item is taken whole or not at all, and DP over items and capacity solves it in O(n · W). Greedy by value per weight fails here, though it works for the fractional version. The same pattern solves subset sum and partition into equal halves.