Question

How to find the largest palindrome made from the product of two 2-digit numbers in Python

Answer 1

def is_palindrome(number):
    return str(number) == str(number)[::-1]

largest_palindrome = 0

# range(start, stop, step) 

for num1 in range(99, 9, -1):
    for num2 in range(num1, 9, -1):
        product = num1 * num2
        if product > largest_palindrome and is_palindrome(product):
            largest_palindrome = product
            
print(largest_palindrome)


    
'''
run:
    
9009

'''

 

70+ SQL courses for beginners and professionals