<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 func(vector<int> &nums,int i,vector<int> &subs,set<vector<int>> &st,vector<vector<int>> &ans){
        if(i==nums.size()){
            vector<int> sorted_subs=subs;
            sort(sorted_subs.begin(),sorted_subs.end());
            if(st.find(sorted_subs)==st.end()){
                ans.push_back(sorted_subs);
                st.insert(sorted_subs);
            }            
            return;
        }

        func(nums,i+1,subs,st,ans);
        subs.push_back(nums[i]);
        func(nums,i+1,subs,st,ans);
        subs.pop_back();
    }

    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        set<vector<int>> st;

        vector<vector<int>> ans;
        vector<int> subs;

        func(nums,0,subs,st,ans);

        return ans;
    }
};
15088