word-subsets

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given two string arrays <code>words1</code> and <code>words2</code>.

A string <code>b</code> is a subset of string <code>a</code> if every letter in <code>b</code> occurs in <code>a</code> including multiplicity.

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

A string <code>a</code> from <code>words1</code> is universal if for every string <code>b</code> in <code>words2</code>, <code>b</code> is a subset of <code>a</code>.

Return an array of all the universal strings in <code>words1</code>. You may return the answer in any order.

&nbsp;
Example 1:

<div class="example-block">
Input: words1 = [&quot;amazon&quot;,&quot;apple&quot;,&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;], words2 = [&quot;e&quot;,&quot;o&quot;]

Output: [&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;]
</div>

Example 2:

<div class="example-block">
Input: words1 = [&quot;amazon&quot;,&quot;apple&quot;,&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;], words2 = [&quot;lc&quot;,&quot;eo&quot;]

Output: [&quot;leetcode&quot;]
</div>

Example 3:

<div class="example-block">
Input: words1 = [&quot;acaac&quot;,&quot;cccbb&quot;,&quot;aacbb&quot;,&quot;caacc&quot;,&quot;bcbbb&quot;], words2 = [&quot;c&quot;,&quot;cc&quot;,&quot;b&quot;]

Output: [&quot;cccbb&quot;]
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words1.length, words2.length &lt;= 104</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 unique.</li>
</ul>