Sync LeetCode submission Runtime - 65 ms (26.82%), Memory - 18.1 MB (12.73%)

Author: jimit105

0680-valid-palindrome-ii/solution.py

@@ -1,25 +1,24 @@
 # Approach: Two Pointers
 
-# Time: O(N)
+# Time: O(n)
 # Space: O(1)
 
 class Solution:
+    def check_palindrome(self, s, i, j):
+        while i < j:
+            if s[i] != s[j]:
+                return False
+            i += 1
+            j -= 1
+        return True
+
     def validPalindrome(self, s: str) -> bool:
-        def check_palindrome(s, i, j):
-            while i < j:
-                if s[i] != s[j]:
-                    return False
-                i += 1
-                j -= 1
-            return True
-        
-        i = 0
-        j = len(s) - 1
+        i, j = 0, len(s) - 1
+
         while i < j:
             if s[i] != s[j]:
-                return check_palindrome(s, i + 1, j) or check_palindrome(s, i, j - 1)
+                return self.check_palindrome(s, i, j - 1) or self.check_palindrome(s, i+ 1, j)
             i += 1
             j -= 1
-            
+
         return True
-