def is_palindrome(n): s=str(n) i=0 d=len(s)-1 while i<=d: if s[i]!=s[d]: return 0 else: i+=1 d-=1 return n
Sign in to make a reply
Dokuroo
def is_palindrome(n): s=str(n) i=0 d=len(s)-1 while i<=d: if s[i]!=s[d]: return 0 else: i+=1 d-=1 return n
def is_palindrome(n):
k = str(n)
return k == k[::-1]