Skip to main content

Subsets

MediumBacktracking

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 subsets in any order.

Example:

Input: nums = [1,2,3]
Output: [[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]

Constraints:

  • 0 <= nums.length <= 10
  • -10 <= nums[i] <= 10
  • All elements of nums are unique