longest_palindrome.py

def longest_palindrome(text):
    text_length = len(text)
    def find(longest_possible):
        for window in range(text_length - longest_possible + 1):
            subtext = text[window:window + longest_possible]
            if subtext == subtext[::-1]:
                return longest_possible
        else:
            return find(longest_possible - 1)

    return find(text_length)

print(longest_palindrome('forgeeksskeegfor'))