Program do sprawdzania czy string jest palindromem

def Palindrome(s): 
    l, h = 0, len(s) - 1
    s = s.lower() 
  
    while (l <= h): 
        if (not(s[l] >= 'a' and s[l] <= 'z')): 
            l += 1
        elif (not(s[h] >= 'a' and s[h] <= 'z')): 
            h -= 1
        elif (s[l] == s[h]): 
            l += 1
            h -= 1
        else: 
            return False
    return True
    
s = "Madam, I'm Adam."
if (Palindrome(s)): 
    print("True")
else: 
    print("False")
    

def filterStr(s):
	return ''.join(c for c in s if c.isalnum()).lower()

def isPalindrome(s):
	filtered = filterStr(s)
	return filtered[:int(len(filtered)/2)] == filtered[-int(len(filtered)/2):][::-1]
	
print(isPalindrome("Madam, I'm Adam."))

def is_palindrome(str):
	str = ''.join([c for c in str.lower() if c.isalpha()])
	return str == str[::-1]
	
print(is_palindrome("Madam, I'm adam.")) 

>>> S='a'*10**8+'x'
>>> %timeit inkanus(S)
135 ms ± 958 µs per loop (mean ± std. dev. of 7 runs, 10 loops each)
>>> %timeit spine(S)
15.2 s ± 31 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
>>> %timeit spartan(S)
11.5 s ± 5.9 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
>>> %timeit mozg(S)
969 ns ± 3.99 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)
>>>