49. Subset Generation with Bits

Medium

Topics

Helpful tools to learn & understand

Watch key transitions, pointers, and variables update step-by-step.

Open

Read clean, documented implementations across multiple patterns.

View Code

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Input: nums = [1, 2, 3]

Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

Explanation: Generates all 2^3 = 8 subsets of the array [1, 2, 3].

Input: nums = [0]

Output: [[],[0]]

Explanation: Generates all 2^1 = 2 subsets of the array [0].

Input: nums = []

Output: [[]]

Explanation: Generates the only subset of an empty array, which is the empty array itself.

Time Complexity

O(2^n * n)

Space Complexity

O(1)