def is_palindrome(n):
x = str(n)
i = -1
while i<len(x):
i=i+1
return x[i]==x[-i-1]
Sign in to make a reply
___iFancy
def is_palindrome(n):
x = str(n)
i = -1
while i<len(x):
i=i+1
return x[i]==x[-i-1]