Subsets
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.
Example 1
Input
nums = [1,2,3]Output
[[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]The power set of three elements contains all 8 combinations, including the empty subset and the full array.
Example 2
Input
nums = [0]Output
[[],[0]]With one element, the only subsets are the empty subset and the subset containing that element.
Constraints
- 1 <= nums.length <= 10
- -10 <= nums[i] <= 10
- All the numbers of nums are unique
Asked at 18 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.