<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:
int n;
vector<vector<int>> result;
set<vector<int>>st;
void  solve(int i,vector<int>&temp,vector<int>&nums){
    if(i>=nums.size()){
        vector<int>sorted=temp;
        sort(sorted.begin(),sorted.end());
        if(st.find(sorted)==st.end()){
            result.push_back(sorted);
            st.insert(sorted);
     
        }
        return;
    }
  temp.push_back(nums[i]);
    solve(i+1,temp,nums);
    temp.pop_back();
    solve(i+1,temp,nums);

}


    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        n=nums.size();
        vector<int>temp;
        solve(0,temp,nums);
        return result;
        
    }
};
10626