Manacher's Algorithm - Linear Time Longest Palindromic Substring - Part 1 - GeeksforGeeks

Manacher's Algorithm - Linear Time Longest Palindromic Substring - Part 1 - GeeksforGeeks

Manacher's Algorithm – Linear Time Longest Palindromic Substring – Part 1

Given a string, find the longest substring which is palindrome.

• if the given string is "forgeeksskeegfor", the output should be "geeksskeeg"
• if the given string is "abaaba", the output should be "abaaba"
• if the given string is "abababa", the output should be "abababa"
• if the given string is "abcbabcbabcba", the output should be "abcbabcba"

Read full article from Manacher's Algorithm - Linear Time Longest Palindromic Substring - Part 1 - GeeksforGeeks