Subsets
mediumGiven 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]]
Explanation: The power set of [1,2,3] contains 8 subsets.
Example 2
Input: nums = [0]
Output: [[],[0]]
Explanation: The power set of [0] contains the empty set and [0].
Constraints
1 <= nums.length <= 10-10 <= nums[i] <= 10All the numbers of nums are unique.
Loading editor...
Test Cases
Click "Run" to execute your code against test cases
← PreviousNext →