Time: 59 ms (68.20%), Space: 16.8 MB (7.47%) - LeetHub

Author: birdieHyun

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

@@ -0,0 +1,17 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        longest = ''
+        answer = []
+        for i in s:
+            if i not in longest:
+                longest += i
+            else:
+                dup_idx = longest.index(i)
+                longest = longest[dup_idx + 1:]
+                longest += i
+
+            answer.append(len(longest))
+        if not answer:
+            return 0
+        
+        return max(answer)