Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for The Longest Palindromic by alterGNU
def is_pal(a):
for i,e in enumerate(a):
if e!=a[-i-1]:return False
return True
def longest_palindromic(a):
for t in range(len(a),-1,-1):
for n in range(len(a)-t):
f=a[n:n+t+1]
if is_pal(f):return f
Aug. 15, 2021
Comments:
