Linear

Manacher's Algorithm — Longest Palindromic Substring in O(n)

Find the longest palindromic substring in O(n) using Manacher's algorithm. Expands palindromes using a mirror trick to avoid redundant work.