Subsets II — Medium Coding Interview Question

Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate subsets.

Example

Input: nums = [1,2,2]

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

Constraints

• 1 ≤ nums.length ≤ 10
• -10 ≤ nums[i] ≤ 10

Topics & Companies

Topics: backtracking, arrays

Asked by: Amazon, Google, Meta, Microsoft

Optimal Solution Complexity

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

Practice more

• All DSA Problems
• DSA Patterns