[beta]longest_palindrome.py

#remodify to match python 2
def longest_palindrome (s):
    print(s)
    if len(s) == 0:
        return 0
    def isPalindrome(string):
        return string == ''.join(string[::-1])
    for i in range(len(s)-1,-1,-1):
        print([i for i in range(len(s)-i)],i)
        for j in [i for i in range(len(s)-i)]:
            if isPalindrome(s[j:i+j+1]):
                return len(s[j:i+j+1])



print(longest_palindrome('baablkj12345432133d'))    
print(longest_palindrome('baa'))
print(longest_palindrome('abba'))