valid palindrome solution

Author: jungsiroo

valid-palindrome/jungsiroo.py

@@ -0,0 +1,7 @@
+import re
+
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+		# Fastest - tc : O(n) / sc : O(1
+        s = ''.join(re.findall(r'[a-z0-9]+', s.lower()))
+        return s == ''.join(reversed(s))