I'm trying to check for a palindrome with Python. The code I have is very for-loop intensive.
def isPalindrome(n): 
    lst = [int(n) for n in str(n)]
    l=len(lst)
    if l==0 || l==1:
        return True
    elif len(lst)%2==0:
        for k in range (l)
        #####
    else:
        while (k<=((l-1)/2)):
            if (list[]):
                #####   
for i in range (999, 100, -1):
    for j in range (999,100, -1):
        if isPalindrome(i*j):
            print(i*j)
            break
I'm missing a lot of code here
PS: The problem is: Find the highest value product of two 3 digit integers that is also a palindrome.