Subsets
We'll cover the following
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:
-
nums.length
-
nums[i]
- All the numbers of
nums
are unique.
Examples
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Educative's Terms of Service and Privacy Policy