524. Longest Word in Dictionary through Deleting LeetCode Solution

Minimum Cost to Merge Stones
Share:

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.

Longest Word in Dictionary through Deleting Solutions

Time: O(n)
Space: O(n)

C++

 Will be updated Soon

Java

 
 Will be updated Soon

Python

  Will be updated Soon

Watch Tutorial

Checkout more Solutions here

Leave a Comment

Your email address will not be published. Required fields are marked *

x