BETA

Difficulty Level: Hard

Total Submissions: 820 Accuracy:

13.05%

Longest Palindromic Substring in Linear Time (Function Problem)
     

Given a string, find the longest substring which is palindrome in Linear time O(N).
Input:

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.
Output:

For each test case print the Longest Palindromic Substring.

Constraints:
1<=T<=100
1<=N<=50
Example:

Input:

2
babcbabcbaccba
forgeeksskeegfor

Output:
abcbabcba
geeksskeeg

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.

** For More Input/Output Examples Use 'Expected Output' option **


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.