Every subset of a set

Given a list of distinct items, return every possible subset — including the empty set and the full set. Notice the shape: the subsets of the whole list are just the subsets of the remaining items, each taken twice — once without the first item, once with it added in. So the problem contains a smaller version of itself, and you solve it by reducing to a list with one fewer item until nothing is left.