<p>Given an integer array <code>nums</code> that may contain duplicates, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span><em> (the power set)</em>.</p>

<p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1,2,2]
<strong>Output:</strong> [[],[1],[1,2],[1,2,2],[2],[2,2]]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [0]
<strong>Output:</strong> [[],[0]]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
</ul>

class Solution {
public:
    void generateSubset(vector<int>& nums, int idx, int size, set<vector<int>> &res, vector<int>& ans){
        if(idx == size){
            res.insert(ans);
            return;
        }

        generateSubset(nums,idx+1,size,res,ans);

        ans.push_back(nums[idx]);
        generateSubset(nums,idx+1,size,res,ans);
        ans.pop_back();
    }
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        set<vector<int>> res;
        vector<int> ans;
        sort(nums.begin(),nums.end());
        generateSubset(nums,0,nums.size(),res,ans);
        vector<vector<int>> result(res.begin(),res.end());
        res.clear();
        ans.clear();
        return result;
        
    }
};
13531