Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Simple recursion solution in Clear category for The Longest Palindromic by fed.kz
def longest_palindromic(text):
if text == text[::-1]: return text
return max(longest_palindromic(text[:-1]), longest_palindromic(text[1:]), key = len)
Oct. 1, 2018
Comments: