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 johankor
def longest_palindromic(text):
step=1
pal=[]
while step <=len(text):
for k in range(len(text)+1-step):
if text[k:k+step] == text[k:k+step][::-1]:
pal.append(text[k:k+step])
step+=1
return max(pal, key=len)
if __name__ == '__main__':
assert longest_palindromic("artrartrt") == "rtrartr", "The Longest"
assert longest_palindromic("abacada") == "aba", "The First"
assert longest_palindromic("aaaa") == "aaaa", "The A"
April 23, 2019
