<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>& words1, vector<string>& words2) {
        vector<string> ans;

        unordered_map<char, int> mp;
        for(int i=0; i<words2.size(); i++){
            unordered_map<char, int> temp;
            for(int j=0; j<words2[i].size(); j++){
                temp[words2[i][j]]++;
                mp[words2[i][j]] = max(mp[words2[i][j]], temp[words2[i][j]]);
            }
        }

        // for(auto it: mp){
        //     cout<<it.first<<" "<<it.second;
        //     cout<<endl;
        // }
        // cout<<endl;
        
        for(int i=0; i<words1.size(); i++){
            unordered_map<char, int> mp1;
            for(int j=0; j<words1[i].size(); j++){
                if(mp.find(words1[i][j]) != mp.end()){
                    if(mp1[words1[i][j]] < mp[words1[i][j]]){
                        mp1[words1[i][j]]++;
                    }
                    else {
                        mp1[words1[i][j]] = mp[words1[i][j]];
                    }
                }
            }
            
            // for(auto it: mp1){
            //     cout<<it.first<<" "<<it.second;
            //     cout<<endl;
            // }
            // cout<<endl;

            if(mp == mp1) ans.push_back(words1[i]);
        }
        
        return ans;
    }
};

137700