<p>You are given two string arrays <code>words1</code> and <code>words2</code>.</p>

<p>A string <code>b</code> is a <strong>subset</strong> of string <code>a</code> if every letter in <code>b</code> occurs in <code>a</code> including multiplicity.</p>

<ul>
	<li>For example, <code>&quot;wrr&quot;</code> is a subset of <code>&quot;warrior&quot;</code> but is not a subset of <code>&quot;world&quot;</code>.</li>
</ul>

<p>A string <code>a</code> from <code>words1</code> is <strong>universal</strong> if for every string <code>b</code> in <code>words2</code>, <code>b</code> is a subset of <code>a</code>.</p>

<p>Return an array of all the <strong>universal</strong> strings in <code>words1</code>. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> words1 = [&quot;amazon&quot;,&quot;apple&quot;,&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;], words2 = [&quot;e&quot;,&quot;o&quot;]
<strong>Output:</strong> [&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> words1 = [&quot;amazon&quot;,&quot;apple&quot;,&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;], words2 = [&quot;l&quot;,&quot;e&quot;]
<strong>Output:</strong> [&quot;apple&quot;,&quot;google&quot;,&quot;leetcode&quot;]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words1.length, words2.length &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= words1[i].length, words2[i].length &lt;= 10</code></li>
	<li><code>words1[i]</code> and <code>words2[i]</code> consist only of lowercase English letters.</li>
	<li>All the strings of <code>words1</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    
    void maxFreq(string s, vector<int> &rep){
        
        vector<int> freq(26,0);
        
        for(int i=0; i<s.size(); i++){
            freq[s[i]-'a']++;
        }
        
        for(int i=0; i<26; i++){
            rep[i] = max(rep[i], freq[i]);
        }
        
    }
    
    bool check(string s, vector<int> rep){
        
        
        vector<int> freq(26,0);
        
        for(int i=0; i<s.size(); i++){
            freq[s[i]-'a']++;
        }
        
        
        for(int i=0; i<26; i++){
            
            if(rep[i] > freq[i]) return false;
            
        }
        
        
        return true;
        
    }
    
    
    vector<string> wordSubsets(vector<string>& word1, vector<string>& word2) {
        
        
        vector<int> rep(26,0);
        int n2 = word2.size();
        vector<string> res;
        int n1 = word1.size();
        
        for(int i=0; i<n2; i++){
            maxFreq(word2[i], rep);
        }
        
        
        for(int i=0; i<n1; i++){
            
            if(check(word1[i], rep)) res.push_back(word1[i]);
            
        }
        
        
        return res;
        
    }
    
};
128699