Locked

Pass the Dictionary check first

Everything after it builds on dictionaries. Each rep in the check has to be passed without opening the solution. Hints and Basics are fine.

Still to clear · 8 of 8

Continue the check

Preview · where this ladder is heading

Every subset

Given a list nums of distinct integers, return every possible subset (the power set), including the empty one and nums itself. No subset may appear twice. The subsets may come in any order, and so may the values inside each subset.

innums = [1, 2, 3]out[[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
innums = [0]out[[], [0]]
innums = []out[[]]

You can read it now. The editor opens when the check is cleared.