Generate all palindromic numbers less than n
Submissions: 680   Accuracy:

43.07%

  Difficulty: Easy   Marks: 2

Count the number of palindromic numbers less than N.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.


Output:

Print the count of all palindromic numbers less than N. Print the answer for each test case in a new line.


Constraints:

1<= T <=100

1<= N <=100000


Example:

Input:

2

12

104

Output:

10

19

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.