Longest palindrome

def longestPalindrome(s: str):
    if len(s) <= 1:
        return s
    
    max_length = 1
    max_string = s[0]
    n = len(s)
    for i in range(n - 1):
        for j in range(i + 1, n):
            if j - i + 1 > max_length and s[i:j + 1] == s[i:j + 1][::-1]:
                max_length = j - i + 1
                max_string = s[i : j + 1]
    return max_string

if __name__ == "__main__":
    s = str(input())
    print(longestPalindrome(s))

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: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: TIME LIMIT EXCEEDED