class Solution {
public:
vector<vector<int> > subsetsWithDup(vector<int> &S) {
set< vector<int> >s;
vector< vector<int> > ans;
vector<int> temp;
sort(S.begin(), S.end());
int len = 1 << S.size();
for( int i = 0 ; i < len ; i++ ) {
for(int j = 0 ; j < S.size() ; j++ ) {
if( i & (1<<j) ) {
temp.push_back(S[j]);
}
}
s.insert(temp);
temp.clear();
}
for( set< vector<int> >::iterator itr = s.begin(); itr != s.end() ; itr++ ) {
ans.push_back(*itr);
}
return ans;
}
};
Arpit's Newsletter read by 15000+ engineers
🔥 Thrice a week, in your inbox, an essay about system design, distributed systems, microservices, programming languages internals, or a deep dive on some super-clever algorithm, or just a few tips on building highly scalable distributed systems.