Find the largest palindrome made from the product of two 3-digit numbers. - Project Euler

largestpalindrome.py

def isPalindrome(a,b):
    s = str(a*b)
    if s == s[::-1]:
        return True
    
palinlist = []    
for i in range(999, 101, -1):
    for j in range(999, 101, -1):
        num = i*j
        if isPalindrome(i,j):
            palinlist.append(num)
print(max(palinlist))