Problem:-
Given a string s, find out the longest palindromic substring in O(N)
using Manacher’s algorithm.
This video explains the Manacher’s Algorithm for finding out the longest Palindromic Substring.
Useful References:-
https://en.wikipedia.org/wiki/Longest_palindromic_substring
http://articles.leetcode.com/2011/11/longest-palindromic-substring-part-ii.html
http://tarokuriyama.com/projects/palindrome2.php
Website: http://www.ideserve.co.in
Facebook: https://www.facebook.com/IDeserve.co.in
source
 Manacher's Algorithm…){kind=link}