EmbeddedInterviewLab

Search topics...

⌘K

Subsets

medium

Solution write-up

bitsTime: O(n * 2^n)Space: O(n * 2^n) for storing all subsetsFrequency: 2

Given an integer array nums of unique elements, return all possible subsets (the power set).

The solution set must not contain duplicate subsets. Return the solution in any order.

Constraints: 1 <= nums.length <= 10. -10 <= nums[i] <= 10. All the numbers of nums are unique.

Example 1:

Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

Example 2:

Input: nums = [0]
Output: [[],[0]]

bit-manipulationrecursion

Shortcuts

SubmitCtrl↵
Toggle commentCtrl/
Find in codeCtrlF
UndoCtrlZ
Exit fullscreenEsc

Interview tips

→Aim for O(n * 2^n) time and O(n * 2^n) for storing all subsets space.
→Walk through your approach with a small example first.
→Handle edge cases: empty input, single element, overflow.
→Code is auto-saved as you type — refresh-safe.

bitsTime: O(n * 2^n)Space: O(n * 2^n) for storing all subsetsFrequency: 2

Given an integer array nums of unique elements, return all possible subsets (the power set).

The solution set must not contain duplicate subsets. Return the solution in any order.

Constraints: 1 <= nums.length <= 10. -10 <= nums[i] <= 10. All the numbers of nums are unique.

Example 1:

Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

Example 2:

Input: nums = [0]
Output: [[],[0]]

bit-manipulationrecursion