<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 solution(vector<int>v,vector<int>nums,int n,int idx,vector<vector<int>>& p){
    if(idx==n){
        sort(v.begin(),v.end());
        auto itr=find(p.begin(),p.end(),v);
        if(itr==p.end()){
            p.push_back(v);
        }
            
        return ;
    }
    solution(v,nums,n,idx+1,p);
    v.push_back(nums[idx]);
    solution(v,nums,n,idx+1,p);
}
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<int>v;
        vector<vector<int>>p;
        solution(v,nums,nums.size(),0,p);
      
        return p;
    }
};
16644