All Team Splits

Given a list of distinct integers `items`, return every possible subset. Return the subsets each sorted ascending, and the overall list sorted (by length, then lexicographically), so the output is deterministic.

Examples

in: items = [1,2]

out: [[], [1], [2], [1,2]]

all four subsets

in: items = []

out: [[]]

only the empty subset

Constraints

0 <= len(items) <= 12
items are distinct

Hints

target: O(n * 2^n) time⌘↩ run · ⇧⌘↩ submit