Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smallest lexicographical order.
If there is no answer, return the empty string. Example 1: Input: words = ["w","wo","wor","worl", "world"] Output: "world" Explanation: The word "world" can be built one character at a time by "w", "wo", "wor", and "worl". Example 2: Input: words = ["a", "banana", "app", "appl", "ap", "apply", "apple"] Output: "apple" Explanation: Both "apply" and "apple" can be built from other words in the dictionary. However, "apple" is lexicographically smaller than "apply". Note:
All the strings in the input will only contain lowercase letters. The length of words will be in the range [1, 1000]. The length of words[i] will be in the range [1, 30].
public class Solution {
public string LongestWord(string[] words) {
var set = new HashSet<string>();
var startCharList = new List<string>();
for(int i=0;i<words.Length;i++){
set.Add(words[i]);
if(words[i].Length==1){
startCharList.Add(words[i]);
}
}
int max = 0;
string str = string.Empty;
for(int i=0;i<words.Length;i++){
var valid = Helper(set,words[i],words[i].Length);
if(valid){
if(max<words[i].Length){
max = words[i].Length;
str = words[i];
}
else if(max == words[i].Length && string.Compare(words[i],str)==-1){
str = words[i];
}
}
}
return str;
}
private bool Helper(HashSet<string> set, string word, int len){
if(len <=0){
return true;
}
if(!set.Contains(word.Substring(0,len))){
return false;
}
return Helper(set,word,len-1);
}
}Time Complexity: O(m*n)
Space Complexity: O(m*n)
Where m and n are the number of strings and maximum characters in the string
