Skip to content
UPEEC

Z Algorithm

Computes for each position the length of the longest substring matching a prefix, in $O(n)$.

Advanced
Comments 0

Pattern search on pattern + '$' + text.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.