<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:
    vector<string> wordSubsets(vector<string>& num1, vector<string>& num2) {
        int m=num1.size();
        int n=num2.size();
        vector<int>valid(m,1);
        vector<string>ans;
        vector<vector<int>>first(m,vector<int>(26,0));
        vector<vector<int>>second(n,vector<int>(26,0));
        for(int i=0;i<m;i++){
            for(int j=0;j<num1[i].size();j++){
               first[i][num1[i][j]-'a']+=1;
            }
        }

        for(int i=0;i<n;i++){
            for(int j=0;j<num2[i].size();j++){
               second[i][num2[i][j]-'a']++;
            }
        }
        
        vector<int>maxi(26);
        for(int i=0;i<26;i++){
            int cnt=0;
        for(int j=0;j<n;j++){
             cnt=max(cnt,second[j][i]);

        }
        maxi[i]=cnt;
        }

        for(int i=0;i<26;i++){
        for(int j=0;j<m;j++){
           if(maxi[i]>first[j][i]){
            valid[j]=0;
            continue;
           }
        }
       
        }
        for(int i=0;i<m;i++)
        if(valid[i]==1)ans.push_back(num1[i]);
        return ans;
        
    }
};
113100