<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:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        int n = nums.size();
        int subsetSize = pow(2,n);
        vector<vector<int>>result;

        set<map<int,int>>stt;

        for(int i=0; i<subsetSize; i++){
            vector<int>temp;
            map <int,int> mp;
            int t = 0;
            int x = i;
            while(t<n){
                if(x&1){
                    temp.push_back(nums[t]);
                    mp[nums[t]]++;
                }
                x = x >> 1;
                t++;
            }
            if(!stt.count(mp)){
                result.push_back(temp);
                stt.insert(mp);
            }
        }
        return result;
    }
};
13946