Practice Replace Words

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#648

LeetCode Problem

Replace Words

Array Hash Table String Trie

Problem Statement

In English, we have a concept called root, which can be followed by some other word to form another longer word - let's call this word derivative. For example, when the root "help" is followed by the word "ful", we can form a derivative "helpful". Given a dictionary consisting of many roots and a sentence consisting of words separated by spaces, replace all the derivatives in the sentence with the root forming it. If a derivative can be replaced by more than one root, replace it with the root that has the shortest length. Return the sentence after the replacement.

Source: Replace Words on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

dictionary = ["cat","bat","rat"], sentence = "the cattle was rattled by the battery"

Output

"the cat was rat by the bat"

# Example 2

Input

dictionary = ["a","b","c"], sentence = "aadsfasf absbs bbab cadsfafs"

Output

"a a b c"

Constraints

1 <= dictionary.length <= 1000

1 <= dictionary[i].length <= 100

dictionary[i] consists of only lower-case letters.

1 <= sentence.length <= 10^6

sentence consists of only lower-case letters and spaces.

The number of words in sentence is in the range [1, 1000]

The length of each word in sentence is in the range [1, 1000]

Every two consecutive words in sentence will be separated by exactly one space.

sentence does not have leading or trailing spaces.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free