MediumBacktracking
Subsets
metaamazonmicrosoftbloomberguberadobe
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.
Examples
Example 1
Input
nums = [1,2,3]
Output
[[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
The power set of [1,2,3] includes all 8 subsets, from the empty set to the full array.
Example 2
Input
nums = [0]
Output
[[],[0]]
With a single element, there are only two subsets: the empty set and the set containing 0.
Example 3
Input
nums = [1,2]
Output
[[],[1],[2],[1,2]]
The power set of [1,2] has 4 subsets.
Constraints
- 1 <= nums.length <= 10
- -10 <= nums[i] <= 10
- All the numbers of nums are unique
Optimal complexity
Time
O(n * 2^n)
Space
O(n * 2^n)
One problem, two ways to prep
Choose between solo practice and interview simulation
Practice Mode keeps things simple with code + tests. AI Interview Mode adds voice, pressure, and a post-round score summary.