Next smaller Palindrome
You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a palindrome.

Note:

1. A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as madam, racecar, 1234321, etc. 2. The numerical value of the given string S will be greater than 0. 3. A single-digit number is also considered a palindrome. 4. The answer number should not contain any leading zeros, except for the case when the answer is 0. 5. Note that the length of the string is nothing but the number of digits in N.

Input Format:

The first line of the input contains an integer T denoting the number of test cases. The first and the only line of each test case contains a string 'S', denoting the number whose next smaller palindrome is to be found.

Output Format:

The only line of output of each test case should contain a string, denoting the next smaller palindrome of 'S'. Output for each test case will be printed in a separate line.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

1

Question

Next smaller Palindrome

You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a palindrome.

Note:

1. A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as madam, racecar, 1234321, etc.
2. The numerical value of the given string S will be greater than 0.
3. A single-digit number is also considered a palindrome.
4. The answer number should not contain any leading zeros, except for the case when the answer is 0.
5. Note that the length of the string is nothing but the number of digits in N.

Input Format:

The first line of the input contains an integer T denoting the number of test cases.

The first and the only line of each test case contains a string 'S', denoting the number whose next smaller palindrome is to be found.

Output Format:

The only line of output of each test case should contain a string, denoting the next smaller palindrome of 'S'.

Output for each test case will be printed in a separate line.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 100
1 <= |S| <= 10^4

Where |S| donates the size of string 'S'.

Time Limit: 1sec

Accepted Answer

Brute Force

Given the fact that the input number is a palindrome itself makes this problem very trivial.
Let us assume that the given string str is a palindrome, so we know that ‘S’ comprises of two halves ‘S₁’ and ‘S₂’ i.e ‘S’ = ‘S₁' + ‘S₂', where ‘S₁' and ‘S₂’ are two strings, and ‘S₂’ is the reverse of ‘S₁’(in case of odd length palindromes ‘S₂’ won’t have the last character of ‘S₁’). So a change in any of the half must also reflect in the other half to keep the output string a palindrome.
So what we can do is either traverse ‘S₁' from the end or ‘S₂’ from the beginning i.e from the middle of the string str to any of the direction, because in this way we would have the option of updating lesser significant digits first.
Let us traverse ‘S₂'from the beginning:

If we find a position in ‘S₂' such that ‘S₂'['POS'] != 0 (digit at ‘S₂'['POS'] is not equal to 0), we can simply update ‘S₂'['POS'] = ‘S₁'['N' - 1 - 'POS'] = ‘S₂'['POS'] - 1 ( considering the size of ‘S’ = ‘N’ and 0-based indexing) and we are done i.e we have reduced the current number and we simply return the string.
However, if ‘S₂'['POS'] = 0, then we cant decrease this digit, and we will look further for non-zero digits. But before going ahead we need to make ‘S₂'['POS'] = ‘S₁'['N' - 1 - 'POS'] = 9, as we want the greatest number less than the current number, so if we keep this digit(and its corresponding digit in ‘S₁') as it is and decrease some more significant digit, then this will not be the correct answer. For eg., next smaller palindrome of 2002 will be 1991 and not 1001.
There is one last case in this approach: Consider the number 1001, now for this number we cant reduce the most significant 1(and it’s corresponding 1 in ‘S₂') to 0 because in such a case the number would have leading zeros, so what we do is the two zeros will be converted to 9 and two ones will be discarded and one extra 9 will be added. This is done because, as we can see 1001 is 4 digit number, and 99 is a 2 digit number, so we add an extra 9, and thus the answer will be 999.

Space Complexity: O(1)Explanation:

O(1)

Constant extra space is used.

Time Complexity: O(n)Explanation:

O(N), where ‘N’ is the length of the given palindrome.

As we are iterating once through the string, hence the overall time complexity will be O(N).

You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a palindrome.

Note:

Input Format:

Output Format:

Note:

Constraints:

Top ZIGRAM Software Developer interview questions & answers

Popular interview questions of Software Developer