Leetcode Problem 524. Longest Word in Dictionary through Deleting
Leetcode Solutions
Approach: Sorting and Checking Subsequence
- Sort the dictionary by the length of the words in descending order. If two words have the same length, sort them lexicographically in ascending order.
- Iterate through the sorted dictionary.
- For each word in the dictionary, check if it is a subsequence of the given string
s. - If a word is a subsequence of
s, return it immediately as it is the longest word with the smallest lexicographical order that can be formed. - If no word in the dictionary is a subsequence of
s, return an empty string.
Approach: Without Sorting
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...