PALIN  The Next Palindrome
A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. For a given positive integer K of not more than 1000000 digits, write the value of the smallest palindrome larger than K to output. Numbers are always displayed without leading zeros.
Input
The first line contains integer t, the number of test cases. Integers K are given in the next t lines.
Output
For each K, output the smallest palindrome larger than K.
Example
Input: 2 808 2133 Output: 818 2222
Warning: large Input/Output data, be careful with certain languages
hide comments
sharingancoder:
20180218 07:28:23
can someone give some corner cases where code can go wrong


adilmah:
20180125 14:39:15
@quock The constraint is given on the number of digits 

shashankpathak:
20180125 10:20:38
I want to ask that if we have to find just preceding palindrome of the number then what should be the approach 

quock:
20180123 08:19:38
Here description say K can not be larger than 1000000 but the test cases assert also a big int


hrk27071999:
20180115 19:39:46
can someone give me corner cases for this code that is easy to mistake? 

jonmanu:
20180115 19:18:32
I got TLE in this program. How should i fix this? 

rswetabh_1995:
20180115 08:57:29
Last edit: 20180115 08:59:30 

bashnewbie:
20180108 15:34:46
Nice problem ;)


anna_9701:
20180107 12:18:31
akash9827 Long int is too short to handle such long number as ~1000000 digits... 

akash9827:
20180106 05:32:10
I did this by reversing the number , i've checked corner cases too , all are correct.

Added by:  adrian 
Date:  20040501 
Time limit:  2s9s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 