# Subsets II Problem

## Description

LeetCode Problem 90.

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:

``````1
2
Input: nums = [1,2,2]
Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
``````

Example 2:

``````1
2
Input: nums = [0]
Output: [[],[0]]
``````

Constraints:

• 1 <= nums.length <= 10
• -10 <= nums[i] <= 10

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
class Solution {
public:

int n;
set<vector<int>> set_ans;

void dfs(int idx, vector<int>& state, vector<int>& nums) {
if (idx == n) {
vector<int> s;
for (int i = 0; i < n; i ++) {
if (state[i] == 1)
s.push_back(nums[i]);
}
sort(s.begin(), s.end());
set_ans.insert(s);
return;
}

state[idx] = 0;
dfs(idx+1, state, nums);

state[idx] = 1;
dfs(idx+1, state, nums);
}

vector<vector<int>> subsetsWithDup(vector<int>& nums) {
n = nums.size();
vector<int> state(n, 0);

dfs(0, state, nums);
vector<vector<int>> ans;

for (auto x : set_ans)
ans.push_back(x);

return ans;
}
};
``````