Longest palindrome

def longestPalindrome(s):
    n = len(s)
    maxLen = 1
    start = 0

    for i in range(n):
        for j in range(2):
            low = i
            high = i + j
            while low >= 0 and high < n and s[low] == s[high]:
                currLen = high - low +1
                if currLen > maxLen:
                    start = low
                    maxLen = currLen
                low -= 1
                high += 1
    return s[start:start + maxLen]


if __name__ == "__main__":
    s = 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: 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