220

Author: Jeldo

valid-palindrome/jeldo.py

@@ -0,0 +1,5 @@
+class Solution:
+    # O(n)
+    def isPalindrome(self, s: str) -> bool:
+        s = ''.join(ch.lower() for ch in s if ch.isalnum())  # O(n)
+        return s == s[::-1]  # O(n)