916. Word Subsets

A word a from words1 is "universal" if, for every b in words2, each letter of b (with its multiplicity) appears in a. Return all universal words. The "for every b" quantifier looks expensive, but it…