def is_palindrome(n):
s1=str(n)
l=len(s1)
print(s1,l)
i=0
while i<l:
if s1[i]==s1[-1-i]:
pass
else:
return False
i=i+1
return True #str(n)==str(n)[::-1]
Sign in to make a reply
VincyChan4231
def is_palindrome(n):
s1=str(n)
l=len(s1)
print(s1,l)
i=0
while i<l:
if s1[i]==s1[-1-i]:
pass
else:
return False
i=i+1
return True #str(n)==str(n)[::-1]