Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Longest Word in Dictionary
Bookmark
Brute Force
Sorting + HashSet
Trie + DFS
Input
Example 1
Example 2
Example 3
Custom
words
=
[w, wo, wor, worl, world]
Phase
Check every prefix of every word
Current Word
—
Result (Longest Word)
""
Words
(5)
w
wo
wor
worl
world
Phase
Check every prefix of every word
Current Word
—
Result (Longest Word)
""
Words
(5)
w
wo
wor
worl
world
Phase
Check every prefix of every word
Current Word
"w"
Result (Longest Word)
"w"
Words
(5)
w
wo
wor
worl
world
Phase
Check every prefix of every word
Current Word
"wo"
Result (Longest Word)
"w"
Words
(5)
w
wo
wor
worl
world
Prefix checks
(1)
w
Phase
Check every prefix of every word
Current Word
"wor"
Result (Longest Word)
"wo"
Words
(5)
w
wo
wor
worl
world
Prefix checks
(1)
w
Phase
Check every prefix of every word
Current Word
"wor"
Result (Longest Word)
"wor"
Words
(5)
w
wo
wor
worl
world
Prefix checks
(2)
w
wo
Phase
Check every prefix of every word
Current Word
"worl"
Result (Longest Word)
"wor"
Words
(5)
w
wo
wor
worl
world
Prefix checks
(1)
w
Phase
Check every prefix of every word
Current Word
"worl"
Result (Longest Word)
"wor"
Words
(5)
w
wo
wor
worl
world
Prefix checks
(3)
w
wo
wor
Phase
Check every prefix of every word
Current Word
"world"
Result (Longest Word)
"worl"
Words
(5)
w
wo
wor
worl
world
Prefix checks
(1)
w
Phase
Check every prefix of every word
Current Word
"world"
Result (Longest Word)
"worl"
Words
(5)
w
wo
wor
worl
world
Prefix checks
(4)
w
wo
wor
worl
Phase
Complete
Current Word
—
Result (Longest Word)
"world"
Words
(5)
w
wo
wor
worl
world
algo
master
.
io
Step:
Put all 5 words in a set for O(1) prefix lookups
0 / 26
Input
Example 1
Example 2
Example 3
Custom
words
=
[w, wo, wor, worl, world]
0 / 26
algo
master
.
io
Step:
Put all 5 words in a set for O(1) prefix lookups