# Count of N-digit Palindrome numbers

Given an integer N, the task is to find the count of N-digit Palindrome numbers.

Examples:

Input: N = 1
Output: 9
{1, 2, 3, 4, 5, 6, 7, 8, 9} are all the possible
single digit palindrome numbers.

Input: N = 2
Output: 9

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: The first digit can be any of the 9 digits (not 0) and the last digit will have to be same as the first in order for it to be palindrome, the second and the second last digit can be any of the 10 digits and same goes for the rest of the digits. So, for any value of N, the count of N-digit palindromes will be 9 * 10(N – 1) / 2.

Below is the implementation of the above approach:

## C++

 `// C++ implementation of the approach ` `#include ` `using` `namespace` `std; ` ` `  `// Function to return the count ` `// of N-digit palindrome numbers ` `int` `nDigitPalindromes(``int` `n) ` `{ ` `    ``return` `(9 * ``pow``(10, (n - 1) / 2)); ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` `    ``int` `n = 2; ` ` `  `    ``cout << nDigitPalindromes(n); ` ` `  `    ``return` `0; ` `} `

## Java

 `// Java implementation of the approach ` `class` `GFG ` `{ ` `     `  `// Function to return the count ` `// of N-digit palindrome numbers ` `static` `int` `nDigitPalindromes(``int` `n) ` `{ ` `    ``return` `(``9` `* (``int``)Math.pow(``10``,  ` `           ``(n - ``1``) / ``2``)); ` `} ` ` `  `// Driver code ` `public` `static` `void` `main(String []args) ` `{ ` `    ``int` `n = ``2``; ` ` `  `    ``System.out.println(nDigitPalindromes(n)); ` `} ` `} ` ` `  `// This code is contributed by Code_Mech `

## Python3

 `# Python3 implementation of the approach  ` ` `  `# Function to return the count  ` `# of N-digit palindrome numbers  ` `def` `nDigitPalindromes(n) : ` ` `  `    ``return` `(``9` `*` `pow``(``10``, (n ``-` `1``) ``/``/` `2``));  ` ` `  `# Driver code  ` `if` `__name__ ``=``=` `"__main__"` `:  ` ` `  `    ``n ``=` `2``;  ` ` `  `    ``print``(nDigitPalindromes(n));  ` ` `  `# This code is contributed by AnkitRai01 `

## C#

 `// C# implementation of the approach  ` `using` `System; ` `     `  `class` `GFG ` `{ ` `     `  `// Function to return the count ` `// of N-digit palindrome numbers ` `static` `int` `nDigitPalindromes(``int` `n) ` `{ ` `    ``return` `(9 * (``int``)Math.Pow(10,  ` `           ``(n - 1) / 2)); ` `} ` ` `  `// Driver code ` `public` `static` `void` `Main(String []args) ` `{ ` `    ``int` `n = 2; ` ` `  `    ``Console.WriteLine(nDigitPalindromes(n)); ` `} ` `} ` ` `  `// This code is contributed by Rajput-Ji `

Output:

```9
```

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.