<p>In English, we have a concept called <strong>root</strong>, which can be followed by some other word to form another longer word - let&#39;s call this word <strong>derivative</strong>. For example, when the <strong>root</strong> <code>&quot;help&quot;</code> is followed by the word <code>&quot;ful&quot;</code>, we can form a derivative <code>&quot;helpful&quot;</code>.</p>

<p>Given a <code>dictionary</code> consisting of many <strong>roots</strong> and a <code>sentence</code> consisting of words separated by spaces, replace all the derivatives in the sentence with the <strong>root</strong> forming it. If a derivative can be replaced by more than one <strong>root</strong>, replace it with the <strong>root</strong> that has <strong>the shortest length</strong>.</p>

<p>Return <em>the <code>sentence</code></em> after the replacement.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> dictionary = [&quot;cat&quot;,&quot;bat&quot;,&quot;rat&quot;], sentence = &quot;the cattle was rattled by the battery&quot;
<strong>Output:</strong> &quot;the cat was rat by the bat&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> dictionary = [&quot;a&quot;,&quot;b&quot;,&quot;c&quot;], sentence = &quot;aadsfasf absbs bbab cadsfafs&quot;
<strong>Output:</strong> &quot;a a b c&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= dictionary.length &lt;= 1000</code></li>
	<li><code>1 &lt;= dictionary[i].length &lt;= 100</code></li>
	<li><code>dictionary[i]</code> consists of only lower-case letters.</li>
	<li><code>1 &lt;= sentence.length &lt;= 10<sup>6</sup></code></li>
	<li><code>sentence</code> consists of only lower-case letters and spaces.</li>
	<li>The number of words in <code>sentence</code> is in the range <code>[1, 1000]</code></li>
	<li>The length of each word in <code>sentence</code> is in the range <code>[1, 1000]</code></li>
	<li>Every two consecutive words in <code>sentence</code> will be separated by exactly one space.</li>
	<li><code>sentence</code> does not have leading or trailing spaces.</li>
</ul>

class Trie:
    def __init__(self):
        self.edges = {}
        self.terminating = False
    
    def traverse(self, searchString, length):
        
        if self.terminating:
            return length

        if len(searchString) == 0:
            return -1

        if searchString[0] in self.edges:
            return self.edges[searchString[0]].traverse(searchString[1:], length + 1)

        return -1
    
    def insertString(self, stringVal):
        if len(stringVal) == 0:
            self.terminating = True
            return

        if not stringVal[0] in self.edges:
            self.edges[stringVal[0]] = Trie()

        nextNode = self.edges[stringVal[0]]
        nextNode.insertString(stringVal[1:])

class Solution:

    def replaceWords(self, dictionary: List[str], sentence: str) -> str:

        rootTrie = Trie()

        for word in dictionary:
            rootTrie.insertString(word)
        
        sentenceList = sentence.split()

        for i in range(len(sentenceList)):
            trieResult = rootTrie.traverse(sentenceList[i], 0)

            if trieResult >= 0:
                sentenceList[i] = sentenceList[i][:trieResult]
        
        return " ".join(sentenceList)

    def replaceWords(self, dictionary: List[str], sentence: str) -> str:
        trie = {}

        for word in dictionary:
            curRoot = trie
            for char in word:
                if char not in curRoot:
                    curRoot[char] = {}
                curRoot = curRoot[char]
            curRoot[-1] = -1
        
        sentenceList = sentence.split()

        for i in range(len(sentenceList)):
            word = sentenceList[i]
            curRoot = trie
            curLength = 0
            valid = False

            for char in word:
                if -1 in curRoot:
                    valid = True
                    break
                
                if char in curRoot:
                    curLength += 1
                    curRoot = curRoot[char]
                else:
                    break
            if valid:
                sentenceList[i] = sentenceList[i][:curLength]
        return " ".join(sentenceList)

28600