Longest Palindromic Substring O(N) Manacher's Algorithm

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... http://articles.leetcode.com/2011/11/... http://tarokuriyama.com/projects/pali... Website: http://www.ideserve.co.in Facebook:   / ideserve.co.in