Easy Problemssubsetpartition
Subset Sum Problem
Given a set of n non-negative integers and a target value, decide whether some subset of the set adds up to exactly that target.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.