49. Subset Generation with Bits

Medium

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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].

Example 2:

Input: nums = [0]

Output: [[],[0]]

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

Example 3:

Input: nums = []

Output: [[]]

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

Constraints:

•
•
•

Time Complexity

O(2^n * n)

Space Complexity

O(1)

49. Subset Generation with Bits

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

49. Subset Generation with Bits

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases