Skip to content
UPEEC

Manacher's Algorithm

Finds the longest palindromic substring in $O(n)$.

Expert
Comments 0

Reuses mirror information around the current palindrome centre.

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.