nPalindromes.py

"""
This week's question:
Given a number n, find the sum of all n-digit palindromes.

Example:
> nPalindromes(2)
> 495 // 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88 + 99

"""


def nSum(nDigits):
    numbers = [int(x) for x in getNums(nDigits)]
    y = 0
    for x in numbers:
        y += x
    return y


def getNums(nDigits):
    lst = []
    for i in range(1, 10):
        string = str(i)
        for n in range(1, nDigits):
            string += string
        lst.append(string)
    return lst


nDigits = int(input("Enter the number of digits: "))
print("nPalindrome is: " + str(nSum(nDigits)))