Next Smaller Palindrome Problem Statement

You are given a palindrome number represented as a string S. Your task is to find the largest palindrome number that is strictly less than S.

Example:

Input:

T = 2
S1 = "12321"
S2 = "98789"

Output:

"12221"
"98689"

Explanation:

For S1 = "12321", the largest palindrome less than it is "12221".
For S2 = "98789", the largest palindrome less than it is "98689".

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ |S| ≤ 104, where |S| denotes the size of string 'S'.