Subsets II
Given an integer array nums that may contain duplicates, return all possible subsets (the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
Example 1
Input
nums = [1,2,2]Output
[[],[1],[1,2],[1,2,2],[2],[2,2]]The duplicate value 2 is handled so each distinct subset appears exactly once.
Example 2
Input
nums = [0]Output
[[],[0]]The only subsets of a single-element array are the empty subset and the subset containing that element.
Constraints
- 1 <= nums.length <= 10
- -10 <= nums[i] <= 10
Asked at 9 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.