Subsets — Medium Coding Interview Question

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.

Example

Input: nums = [1,2,3]

Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

Constraints

• 1 ≤ nums.length ≤ 10
• All elements are unique
• -10 ≤ nums[i] ≤ 10

Topics & Companies

Topics: backtracking, arrays

Asked by: Amazon, Google, Meta, Microsoft, Bloomberg

Optimal Solution Complexity

Time complexity: O(n × 2^n). Space complexity: O(n × 2^n).

Practice more

• All DSA Problems
• DSA Patterns