Problem 1032 · Hard

Stream of Characters

Accept letters one at a time and report whether any stored word ends at the newest letter. The matcher walks backward through the stream against reversed stored words.

Open the interactive visualisation