Medium Problemssubsetcounting
All distinct subset (or subsequence) sums
Given a set of n non-negative integers, find every distinct total that can be formed by adding up some subset of its elements, including the empty subset's total of zero.
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.