## DEV Community

Abhishek Chaudhary

Posted on

# Longest Word in Dictionary through Deleting

Given a string `s` and a string array `dictionary`, return the longest string in the dictionary that can be formed by deleting some of the given string characters. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.

Example 1:

Input: s = "abpcplea", dictionary = ["ale","apple","monkey","plea"]
Output: "apple"

Example 2:

Input: s = "abpcplea", dictionary = ["a","b","c"]
Output: "a"

Constraints:

• `1 <= s.length <= 1000`
• `1 <= dictionary.length <= 1000`
• `1 <= dictionary[i].length <= 1000`
• `s` and `dictionary[i]` consist of lowercase English letters.

SOLUTION:

``````class Solution:
def findLongestWord(self, s: str, dictionary: List[str]) -> str:
words = {}
for word in dictionary:
if len(word) <= len(s):
i = 0
j = 0
while i < len(word) and j < len(s):
if word[i] == s[j]:
i += 1
j += 1
else:
j += 1
if i == len(word):
words[len(word)] = words.get(len(word), []) + [word]
if len(words) == 0:
return ""
return min(words[max(words.keys())])
``````