https://projecteuler.net/problem=4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
In [65]:
p=[] #empty list
for x in range(1000):
for y in range(1000): #gives all combination with x and y <1000 3 digits
z=x*y #define z
if str(z)==str(z)[::-1]: #added to list if z is palindrome
p.append(z)
print(max(p)) #gives the largest palindrome
In [45]:
# This cell will be used for grading, leave it at the end of the notebook.
In [ ]: