Question

Longest palindromic substring manacher's algorithm wiki

Answer 1

Explanation:

In computer science, the longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous substring of a given string that is also a palindrome. For example, the longest palindromic substring of "bananas" is "anana".

hope you get it now....