<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:
    set<vector<int>>a;

    void trav(int i, vector<int>& nums, vector<int>&x){
        if (i < 0){
            a.insert(x);
            return;
        }

        x.push_back(nums[i]);
        trav(i-1, nums, x);
        x.pop_back();
        trav(i-1, nums, x);
    }

    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<vector<int>>ans;

        vector<int>x;
        trav(nums.size()-1, nums, x);

        set<vector<int>>a1;
        for(auto it : a){
            vector<int>y = it;
            sort(y.begin(), y.end());
            a1.insert(y);
        } 
        
        for(auto it : a1) ans.push_back(it);

        return ans;
    }
};
10523