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.

30:00

Subsets
medium
Topics
Companies

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: [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
Constraints:

  • 1≤nums.length≤101 \leq \text{nums.length} \leq 10

  • −10≤nums[i]≤10-10 \leq \text{nums}[i] \leq 10

  • All elements of nums are unique.

Input
arr =[1,2,3]

Check index 0 >= 3

Candidates

1

2

3

Current Combination

Empty

Sum: 0
Found Solutions
Variables
No variables to display
DepthFunction Call
Stack empty
0/36