🎯 Manacher's Algorithm

Longest Palindromic Substring - Linear Time Solution

📝 Custom Input

Quick Examples:
Current Input: babad
Expected Output: bab
Current Position
Center
Palindrome
Mirror Position
Right Boundary
Transformed String (with # separators)
DP Array (Palindrome Radius)
Current Result
Step 0 of 0

Step 0: Ready to Start

Use the slider or +/- buttons to step through Manacher's algorithm.

📊 Algorithm State

Position i: 0
Center: 0
Right: 0
Max Length: 1

📝 Problem Info

Original String: babad

Transformed Length: 9

Algorithm: Manacher's

Time Complexity: O(n)

Space Complexity: O(n)