Leetcode 1032. Stream of Characters

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.