Word Subsets In PHP: Finding Universal Strings
Find universal strings in words1 where each string in words2 is a subset. Count max char freq in words2 & check each word in words1. Return universal words.
916. Word Subsets Difficulty: Medium Topics: Array, Hash Table, String 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","goog...