› Longest Palindrome — Manacher's Algorithm O(n)

Expand around each center, reusing mirror information to skip redundant comparisons. Track the rightmost boundary R and its center C.

0 / 0
center C
palindrome
mirror i'
match
mismatch
expand
radii table P[i] — palindrome radius centered at i
Current P[i]
—
Best palindrome
—
Case
—
← prev   → next   Space play/pause   R reset   S skip to best