Leetcode Problem 748. Shortest Completing Word

748. Shortest Completing Word

Leetcode Solutions

Using Counter and Filtering

  1. Convert licensePlate to lowercase and filter out non-alphabetic characters.
  2. Create a Counter for the filtered licensePlate to count the occurrence of each character.
  3. Sort the words array by the length of the words in ascending order.
  4. Iterate through the sorted words array.
  5. For each word, create a Counter to count the occurrence of each character.
  6. Check if the word's Counter contains at least the same count for each character as the licensePlate's Counter.
  7. If the word satisfies the condition, return it as it is the shortest completing word due to the sorting step.
  8. If no word satisfies the condition (which is guaranteed not to happen), return an empty string.
UML Thumbnail

Brute Force Search

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...