<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 check(vector<int>&nums,vector<int>&temp,vector<vector<int>>&ans,int index,int n)
{
   if(index==n)
   {
     ans.push_back(temp);
     return;
   }
   check(nums,temp,ans,index+1,n);
   temp.push_back(nums[index]);
   check(nums,temp,ans,index+1,n);
   temp.pop_back();
}
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        vector<vector<int>>ans;
        vector<int>temp;
        check(nums,temp,ans,0,nums.size());
        vector<vector<int>>ans2;
        set<vector<int>>s;
        for(int i=0;i<ans.size();i++)
        {
            s.insert(ans[i]);
        }
        for(auto i:s)
        {
            ans2.push_back(i);
        }
        return ans2;
    }
};
12494