Search⌘ K
AI Features

Stream of Characters

Explore how to design a custom data structure that processes a continuous stream of characters and checks if any suffix matches a word from a predefined list. This lesson helps you implement query operations that append characters and efficiently detect word matches, enhancing your skills in handling real-time string processing problems in coding interviews.

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 ‘d’, ‘c’, ‘a’\text{`d', `c', `a'}, and ‘t’\text{`t'} ...