class Solution {

public:

  vector<vector<int>> subsetsWithDup(vector<int> &S) {

        vector<vector<int>> totalset = {{}};

        sort(S.begin(),S.end());

        for(int i=; i<S.size();){

            int count = ; // num of elements are the same

            while(count + i<S.size() && S[count+i]==S[i])  count++;

            int previousN = totalset.size();

            for(int k=; k<previousN; k++){

                vector<int> instance = totalset[k];

                for(int j=; j<count; j++){

                    instance.push_back(S[i]);

                      totalset.push_back(instance);

                }

            }

            i += count;

        }

        return totalset;

        }

};