Leetcode 3023. Find Pattern in Infinite Stream I

Given a fixed pattern and an infinite character stream arriving one character at a time, determine online whether the pattern has just appeared as a contiguous substring ending at the current position. The challenge is to maintain state efficiently (e.g., with a prefix-function/KMP-style automaton) to support fast per-character queries using O(pattern length) space.