Leetcode 125. Valid Palindrome

https://leetcode.com/problems/valid-palindrome/

String processing.

Solution:

# T:O(n) S:O(1)
class Solution:
    # @param s, a string
    # @return a boolean
    def isPalindrome(self, s):
        i, j = 0, len(s) - 1
        while i < j:
            while i < j and not s[i].isalnum():
                i += 1
            while i < j and not s[j].isalnum():
                j -= 1
            if s[i].lower() != s[j].lower():
                return False
            i, j = i + 1, j - 1
        return True

Run Time: 108 ms