def is_palindrome(n): m=str(n) L=len(m) for i in range(L): if m[i]!=m[L-i-1]: return False return True
Sign in to make a reply
antenna_coder
def is_palindrome(n): m=str(n) L=len(m) for i in range(L): if m[i]!=m[L-i-1]: return False return True