Longest Palindromic Substring Problem Statement

You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palindromic substrings have maximum lengths, return the substring which begins at the smaller index.

Input:

The first line consists of an integer 'T', indicating the number of test cases.
Each test case contains one line, a string 'STR'.

Output:

For each test case, print the longest palindromic substring on a separate line.
If there is more than one, choose the one with the smallest start index.

Example:

Input:

T = 1
STR = "ababc"

Output:

"aba"

Explanation:

The longest palindromic substring of "ababc" is "aba". Although "bab" is also a palindrome of the same length (3), "aba" starts earlier.

Constraints:

• 1 <= T <= 10
• 0 <= N <= 10^3
• Each 'STR' is composed of lowercase English letters.
• Time Limit: 1 second