Medium
Quiz
#78 Subsets
APPROACH
Given integer array nums of unique elements, return all possible subsets (the power set). No duplicate subsets are allowed; results may be in any order.
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]]
1 of 4
1:00
What is the optimal approach for this problem?