Palindrome Checking (Python)

@vegaseat's original solution is a concise, idiomatic way to filter non-letters and compare the result with its reverse. The thread's follow-ups suggest useful variants: @Kolz asked for a while-loop approach, @kisan about using .replace/.lower, and @Baladya4 asked what the comprehension does (as @Gribouillis pointed to the docs).

A two‑pointer while-loop avoids allocating a cleaned list or string and answers @Kolz directly:

def is_palindrome_two_pointer(s):
    i, j = 0, len(s) - 1
    while i < j:
        while i < j and not s[i].isalpha():
            i += 1
        while i < j and not s[j].isalpha():
            j -= 1
        if s[i].casefold() != s[j].casefold():
            return False
        i += 1
        j -= 1
    return True

This is single-pass (O(n)) with O(1) extra memory. casefold() is preferred for Unicode-aware case-insensitive comparison; restrict to ASCII or use .lower() if only ASCII letters are desired.

For a .replace-style cleanup (answering @kisan) the code below produces a cleaned string and compares it to its reverse — simpler to read, slightly more memory use:

import re, string

# regex: keep letters and digits
clean = re.sub(r'[^A-Za-z0-9]', '', s).casefold()
result = (clean == clean[::-1])

# or translate (Python 3): remove punctuation + whitespace
rem = str.maketrans('', '', string.punctuation + string.whitespace)
clean = s.translate(rem).casefold()
result = (clean == clean[::-1])

For @Baladya4: the list-comprehension in the original post is simply shorthand for "loop over each character of the lowercased string, test isalpha(), and collect the passing characters" — it produces the filtered sequence used for the palindrome check. Final notes: include digits with isalnum() if desired, and prefer Python 3 for robust Unicode handling.