Question

How to find the largest palindrome made from the product of two 3-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(999, 99, -1):
    for num2 in range(num1, 99, -1):
        product = num1 * num2
        if product > largest_palindrome and is_palindrome(product):
            largest_palindrome = product
            
print(largest_palindrome)


    
'''
run:
    
906609

'''

 

70+ SQL courses for beginners and professionals

Answer 2

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

def largest_palindrome():
    max_palindrome = 0
    # range(start, stop, step) 
    for i in range(999, 99, -1):  # Loop from 999 down to 100
        for j in range(i, 99, -1):  # Avoid duplicate calculations
            product = i * j
            if product > max_palindrome and is_palindrome(product):
                max_palindrome = product

    return max_palindrome

print(largest_palindrome())



'''
run:

906609

'''

 

70+ SQL courses for beginners and professionals