We're given a fixed text, and we are presented with a series of online queries of patterns. For each query, the goal is to answer if the pattern exists in the text. Each pattern is a string, and we want to know if it appears as a substring of the text. The text can be preprocessed.What's the optimal way to solve this?
Search a preprocessed text with online queries
optimization;strings;online algorithms