Find the Longest Palindromic Substring

Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.

If there are multiple longest palindromic substrings of the same length, return the rightmost one in the given string.

Example:

Input:

bbbab

Output:

bab

Explanation:

In the string “bbbab”, there are two longest palindromic substrings of equal length: “bbb” and “bab”. The rightmost one, “bab”, should be returned.

Constraints:

• 1 <= T <= 50
• 1 <= N <= 100

Where ‘N’ is the length of the string.

Note:

A substring is a contiguous sequence of characters within a string. A string is a palindrome if it reads the same forwards and backwards.

Note:

You do not need to print anything; this has been handled. Implement the function to return the desired result.