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 Angelika
def longest_palindromic(text):
pal=""
x=""
for i in range (0,len(text)):
k=i
x=""
j=len(text)-1
while j>=k:
a=text[k:k+1]
b=text[j:j+1]
if a==b:
x=x+a
k=k+1
j=j-1
else:
j=j+k-1-i
x=""
k=i
if k-j==2:
n=len(x)-1
else:
n=len(x)
for j in range(n):
m=x[n-1-j:n-j]
x=x+m
if len(x)>len(pal):
pal=""
pal=x
x=""
return pal
if __name__ == '__main__':
assert longest_palindromic("artrartrt") == "rtrartr", "The Longest"
assert longest_palindromic("abacada") == "aba", "The First"
assert longest_palindromic("aaaa") == "aaaa", "The A"
Nov. 1, 2016