def longest_palindrome(s: str) -> str:
    palindromo = ""

    for i in range(len(s)):
        for j in range(i+1,len(s)+1):
            sub = s[i:j]

            if sub == sub[::-1] and len(sub) > len(palindromo):
                palindromo = sub
    return palindromo