def is_palindrome(n):
n = str(n)
s = len(n)
c = round(s/2)
for k in range(0,c):
if n[k] != n[-(k+1)]:
return False
return True
Sign in to make a reply
right-chen
def is_palindrome(n):
n = str(n)
s = len(n)
c = round(s/2)
for k in range(0,c):
if n[k] != n[-(k+1)]:
return False
return True