Find the minimum length word from a given dictionary
words, which has all the letters from the string
licensePlate. Such a word is said to complete the given string
Here, for letters we ignore case. For example,
"P" on the
licensePlate still matches
"p" on the word.
It is guaranteed an answer exists. If there are multiple answers, return the one that occurs first in the array.
The license plate might have the same letter occurring multiple times. For example, given a
"PP", the word
"pair" does not complete the
licensePlate, but the word
Input: licensePlate = "1s3 PSt", words = ["step", "steps", "stripe", "stepple"] Output: "steps" Explanation: The smallest length word that contains the letters "S", "P", "S", and "T". Note that the answer is not "step", because the letter "s" must occur in the word twice. Also note that we ignored case for the purposes of comparing whether a letter exists in the word.
Input: licensePlate = "1s3 456", words = ["looks", "pest", "stew", "show"] Output: "pest" Explanation: There are 3 smallest length words that contains the letters "s". We return the one that occurred first.
licensePlatewill be a string with length in range
licensePlatewill contain digits, spaces, or letters (uppercase or lowercase).
wordswill have a length in the range
words[i]will consist of lowercase letters, and have length in range
Intuition and Algorithm\n
A natural question is, how to tell whether a
"steps" completes a
We count the number of letters in both
licensePlate, converting to lowercase and ignoring non-letter characters. If the count of each letter is greater or equal in the word, then that word completes the
From the words that complete
licensePlate, we should keep the one with the shortest length (with ties broken by whether it occurs first.)
Time Complexity: where is the length of
words, and assuming the lengths of
words[i] are bounded by .
Space Complexity: in additional space.\n
Analysis written by: @awice.\n