62. Manacher's Algorithm

Hard

Topics

Helpful tools to learn & understand

Visualize LogicActive Simulator

Watch key transitions, pointers, and variables update step-by-step.

Open

Check Solutions

Read clean, documented implementations across multiple patterns.

View Code

Thinkpad (Draw & Note)

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Example 1:

Input: s = "babad"

Output: "bab" or "aba"

Explanation: Both "bab" and "aba" are valid palindromic substrings of maximum length.

Example 2:

Input: s = "cbbd"

Output: "bb"

Explanation: "bb" is the longest palindromic substring.

Example 3:

Input: s = "a"

Output: "a"

Explanation: A single character string is a palindrome of itself.

Example 4:

Input: s = "ac"

Output: "a" or "c"

Explanation: Either character forms a palindrome of length 1.

Example 5:

Input: s = ""

Output: "(empty string)"

Explanation: An empty string has no palindromic substrings, so it returns empty string.

Constraints:

•
•

Time Complexity

O(n)

Space Complexity