Largest Palindrome Product
12345678910111213141516
def largest_palindrome_product(n):
m = n
o = n
largest = 0
while o > 100:
m = n
while m > 100:
num = m * o
if str(num) == str(num)[::-1]:
if num > largest:
largest = num
m -= 1
o -= 1
return largest
print(largest_palindrome_product(999))
Python
INFO