longest substring without repeating characters solution

Author: devyejin

longest-substring-without-repeating-characters/devyejin.py

@@ -0,0 +1,14 @@
+# space complexity O(n), time complexity O(1)
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        seen = {}
+        left = 0
+        max_length = 0
+
+        for right, char in enumerate(s):
+            if char in seen and seen[char] >= left:
+                left = seen[char] + 1
+            seen[char] = right
+            max_length = max(max_length, right - left + 1)
+
+        return max_length