Package g0901_1000.s0916_word_subsets

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    916 - Word Subsets.

    Medium

    You are given two string arrays words1 and words2.

    A string b is a subset of string a if every letter in b occurs in a including multiplicity.

    • For example, "wrr" is a subset of "warrior" but is not a subset of "world".

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

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

    Example 1:

    Input: words1 = "amazon","apple","facebook","google","leetcode", words2 = "e","o"

    Output: "facebook","google","leetcode"

    Example 2:

    Input: words1 = "amazon","apple","facebook","google","leetcode", words2 = "l","e"

    Output: "apple","google","leetcode"

    Constraints:

    • <code>1 <= words1.length, words2.length <= 10<sup>4</sup></code>

    • 1 &lt;= words1[i].length, words2[i].length &lt;= 10

    • words1[i] and words2[i] consist only of lowercase English letters.

    • All the strings of words1 are unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<String> wordSubsets(Array<String> words1, Array<String> words2)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait