Tap here to switch tabs
Problem
Submissions

Problem: Subsets

Subsets asks you to return every possible subset of an array of unique integers, including the empty set, without duplicate subsets. The result may be in any order.

Statement

Given an array of integers, nums, find all possible subsets of nums, including the empty set.

Note: The solution set must not contain duplicate subsets. You can return the solution in any order.

Constraints:

  • 1≤1 \leq nums.length ≤10\leq 10
  • −10≤-10 \leq nums[i] ≤10\leq 10
  • All the numbers of nums are unique.
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Subsets

Subsets asks you to return every possible subset of an array of unique integers, including the empty set, without duplicate subsets. The result may be in any order.

Statement

Given an array of integers, nums, find all possible subsets of nums, including the empty set.

Note: The solution set must not contain duplicate subsets. You can return the solution in any order.

Constraints:

  • 1≤1 \leq nums.length ≤10\leq 10
  • −10≤-10 \leq nums[i] ≤10\leq 10
  • All the numbers of nums are unique.