1. You are given one string s1.Input Format
2. You have to find the longest palindromic substring in s1.
3. Expected Complexity : O(n)
one string s1Output Format
Print the length of the longest palindrome substring in the first line. In the second line print the longest palindromic substring in s1. If there is more than one palindromic substring with the maximum length, output the first one.Question Video
1 <= length of the string <= 10^5Sample Input
Asked in Companies