Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
F solution in Clear category for The Longest Palindromic by super2008
def cutt(t):
return t if t==t[::-1] else cutt(t[:-1])
def longest_palindromic(text):
k=list(map(cutt, [text[i:] for i in range(len(text))]))
return max(k, key=len)
March 21, 2016
Comments: