Subsets
Solution ApproachWas this helpful?
Medium•bits•Expected: O(n * 2^n) time, O(n * 2^n) for storing all subsets space
bit-manipulationrecursion
Problem
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]]
Reference solution unlocks after your first submission
Loading...