78. Subsets

Medium

Description

Given an integer array nums of unique elements, return all possible subsets (1) (the power set).

1. Subset

   • A subset of an array is a selection of elements (possibly none) of the array.

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

Constraints:

• 1 <= nums.length <= 10
• -10 <= nums[i] <= 10
• All the numbers of nums are unique.

Solutions

Akhil Singh Chauhan
Creator

Comments