Problem 4

Problem: 

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.


My Solution:

p=[]
def ispali(s):
    for k in range(0,len(s)):
      if s[k] != s[len(s)-1-k]:
        return False
    return True

for i in range(100,1000):
  for j in range(100,1000):
    if ispali(str(i*j)):
      p=p+[i*j]

print max(p)