class Solution { public: vector frequncey(string s) { vector freq(26, 0); for (int i = 0; i < s.length(); i++) freq[s[i] - a]++; return freq; } vector wordSubsets(vector &words1, vector &words2) { vector ans; vector Freq(26, 0); for (auto &x : words2) { vector freq1 = frequncey(x); for (int i = 0; i < 26; i++) Freq[i] = max(freq1[i], Freq[i]); } for (auto &x : words1) { vector freq1 = frequncey(x); bool flag = true; for (int i = 0; i < 26; i++) { if (freq1[i] < Freq[i]) { flag = false; break; } } if (flag) ans.push_back(x); } return ans; } }; C++ Word Subsets Code Telegram - @offcampusjobs24 450 viewsElliot, 10:28
