NeetCode #137LC-916MediumArrays & Hashing
← Back to All Problems#137 · #916 · Word Subsets(单词子集)
📌 Problem Statement & Constraints
A string
a is a subset of string b if every letter of a occurs in b at least as many times. Given words1 and words2, return every word in words1 that is a superset of every word in words2. Constraints: 1 <= words1.length, words2.length <= 10^4, 1 <= word length <= 10.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!