Solution: Stream of Characters

Explore how to design and implement a custom data structure that processes a stream of characters to check if any suffix matches a word in a given list. Understand the use of a reversed Trie and a deque for efficient string matching, enabling you to handle dynamic suffix queries with optimized time and space complexity.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

Design a data structure that processes a stream of characters and, after each character is received, determines if a suffix of these characters is a string in a given array of strings words.

For example, if words = ["dog"] and the stream adds the characters $\text{`d', `c', `a'}$ , and $\text{`t'}$ in sequence, the algorithm should detect that the suffix "cat" of the stream "dcat" matches the word "cat" from the list.

So, for words, the goal is to detect if any of these words appear as a suffix of the stream built so far. To accomplish this, implement a class StreamChecker:

Constructor: Initializes the object with the list of target words.
boolean query(char letter): Appends a character to the stream and returns TRUE if any suffix of the stream matches a word in the list words.

Constraints:

$1\leq$ words.length ...