Leetcode Problem 125 Valid Palindrome.txt

125. Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

Note: For the purpose of this problem, we define empty string as valid palindrome.

Example 1:

Input: "A man, a plan, a canal: Panama"
Output: true
Example 2:

Input: "race a car"
Output: false

class Solution:
    def isPalindrome(self, s: str) -> bool:
        s = s.lower()
        s = s.translate(str.maketrans('', '', string.punctuation))
        s = s.replace(" ","")
        
        start = 0
        end = len(s) - 1
        
        while(start<end):
            if s[start] != s[end]:
                return False
            
            start += 1
            end -= 1
            
        return True