AlgoLounge

Subsets

medium

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.

Examples

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]]

Constraints

  • 1 <= nums.length <= 10
  • -10 <= nums[i] <= 10
  • All the numbers of nums are unique
TypeScript
Loading editor…
List of test cases (8)
Case 1
nums = [1,2,3]
Case 2
nums = [0]
Case 3
nums = [1,2]
Case 4
nums = [5,10]
Case 5
nums = [1,2,3,4]
Case 6
nums = [-1,0,1]
Case 7
nums = [7]
Case 8
nums = [1,5,3]