Gamified challenge · Backtracking
items holds the treasures, each a different number. A bag is any selection of them, each treasure taken at most once, and the empty bag counts too.
Write subsets(items) that returns every possible bag exactly once. The bags, and the treasures inside each, may come in any order, so [3, 1] and [1, 3] are the same bag.
Example: items = [1, 2, 3] gives the 8 bags [[], [1], [1, 2], [1, 2, 3], [1, 3], [2], [2, 3], [3]].
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google