Longest palindrome

def get_palindrome_around_center(s, left, right):
    while left >= 0 and right < len(s) and s[left] == s[right]:
        left -= 1
        right += 1
    return s[left + 1:right]

def longestPalindrome(s):
    max_palindrome = ""
    
    for index in range(len(s)):
        odd_pal = get_palindrome_around_center(s, index, index)
        even_pal = get_palindrome_around_center(s, index, index + 1)
        
        current_longest = odd_pal if len(odd_pal) > len(even_pal) else even_pal
        
        if len(current_longest) > len(max_palindrome):
            max_palindrome = current_longest
            
    return max_palindrome

if __name__ == "__main__":
    input_str = input()
    print(longestPalindrome(input_str))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: TIME LIMIT EXCEEDED