Available question text
Given a stream of characters, after each queried character determine whether any non-empty suffix of the accumulated stream matches a word from a given list; the core challenge is online suffix matching efficiently (up to 4×10^4 queries, words length ≤200), typically handled with a reversed trie or string-matching automaton.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1032. Stream of Characters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source