Preparing this workspace.
Subsets II
Difficulty: Medium
Category: DSA
Topics: Array, Backtracking, Bit Manipulation
Asked at: Amazon, ByteDance
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]]
```
**Example 2:**
**Input:** nums = [0]
**Output:** [[],[0]]
```
**Constraints:**
- `1 <= nums.length <= 10`
- `-10 <= nums[i] <= 10`
Opening the problem
Progress is saved as you study.