<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:
    def wordSubsets(self, words1: List[str], words2: List[str]) -> List[str]:
        out=[] 
        def compare(chars,word):
            d={} # characters dictionary... 
            for i in chars: 
                if i in d:
                    d[i]+=1
                else:
                    d[i]=1

            dword={} # words dictionary

            for i in word:
                if i in dword:
                    dword[i]+=1
                else:
                    dword[i]=1
            c=0
            for i,j in d.items():
                if (i in dword.keys()) and (j<=dword[i]):
                    c+=1
                else: 
                    #print("Not a word",word) 
                    return False
            return True
        
         
        for i in range(len(words2)):
            words2[i]=tuple(sorted(words2[i]))  
        print(words2)
        words2[0]=tuple(words2[0]) 
        print(str(words2[0]),type(words2[0])) 
        words2=set(words2) 
        

        for word in words1:
            mc=0
            for i in words2: 
                if(compare(i,word)):
                    mc+=1
                    #print(mc,"mc")
                else:
                    break
            if mc==len(words2):
                #print("Answerrrrrrrr:",word)  
                out.append(word) 
        print(out) 
        return out


21700