Available question text
Return all strings a in words1 that are "universal" — meaning for every b in words2, every character in b appears in a with at least the same multiplicity. This reduces to computing the maximum required count per letter across words2 and filtering words1 by comparing character frequency vectors.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 916. Word Subsets
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source