Medium
Subsets
Medium
0 submissions
25 coins
+100 XP
Array
Backtracking
Bit Manipulation
Problem Description
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]]
```
**Example 2:**
```
Input: nums = [0]
Output: [[],[0]]
```
**Example 3:**
```
Input: nums = [1,2]
Output: [[],[1],[1,2],[2]]
```
Constraints
- 1 <= nums.length <= 10
- -10 <= nums[i] <= 10
- All the numbers of `nums` are **unique**
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share