There are many ways to find the longest palindromic substring. One can find it in $O(N ^ 3)$ and also in $O(N ^ 2)$ time complexity. But using Manacher's Algorithm we ...

* Linear time Manacher's algorithm to find longest palindromic substring. * There are 4 cases to handle * Case 1 : Right side palindrome is totally contained under current palindrome. In this case do ...