<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>

#include<bits/stdc++.h>
class Solution {
public:
    bool subset(string word1,unordered_map<char,int>&wordmap)
    {
        unordered_map<char,int>map1;
        for(int i=0;i<word1.length();i++)
        {
            map1[word1[i]]++;
        }
        
        for(auto it:wordmap)
        {
            if(it.second>map1[it.first])
            {
                return false;
            }
        }
        return true;

    }
    void calculate(string word1,unordered_map<char,int>&wordmap)
    {
         unordered_map<char,int>map1;
        for(int i=0;i<word1.length();i++)
        {
            map1[word1[i]]++;
        }
         for(auto it:map1)
        {
            if(it.second>wordmap[it.first])
            {
                wordmap[it.first]=it.second;
            }
        }

    }
    vector<string> wordSubsets(vector<string>& words1, vector<string>& words2) {

        int m=words1.size();
        vector<string>ans;
        int n=words2.size();
        // for(int i=0;i<m;i++)
        // {
        //     bool flag=true;
        //     for(int j=0;j<n;j++)
        //     {
        //         if(subset(words1[i],words2[j])==false)
        //         {
        //             flag=false;
        //             break;
        //         }

        //     }
        //     if(flag)
        //     {
        //         ans.push_back(words1[i]);
        //     }
        // }
        unordered_map<char,int>wordmap;
        for(int i=0;i<n;i++)
        {
            calculate(words2[i],wordmap);
        }
        for(int i=0;i<m;i++)
        {
            if(subset(words1[i],wordmap))
            {
                ans.push_back(words1[i]);
            }
        }
        return ans;
        
    }
};
166800