Given a string, find the longest substring which is palindrome in Linear time O(N).
The first line of input contains an integer T denoting the no of test cases . Then T test cases follow. The only line of each test case contains a string.
For each test case print the Longest Palindromic Substring. If there are multiple such substrings of same length, print the one which appears first in the input string.
1 <= T <= 100
1 <= N <= 50
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.