<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>& v1, vector<string>& v2) {
    vector<string> v3;
    //v2 = {"o","e"};
    //v1= {"amazon","apple","facebook","google","leetcode"};
    int sze1=v1.size();
    int sze2=v2.size();
    unordered_map<char, int> m1,m2;
    string s;
    for (int i=0;i<sze2;i++) {
        for (int j=0;j<v2[i].size();j++) {
            m1[v2[i][j]]++;
            if (m1[v2[i][j]]>m2[v2[i][j]]) {
                m2[v2[i][j]]=m1[v2[i][j]];
            }
        }
        m1.clear();
    }
    int flag=0;
    for (int i=0;i<sze1;i++) {
        
        for (auto j:m2) {
            if (count(v1[i].begin(), v1[i].end(), j.first) < j.second) {
                flag=1;
            }
        }
        if (!flag) {
            v3.push_back(v1[i]);
        }
        flag=0;
    }
    return v3;
    }
};
76300