Time: 644 ms (10.24%), Space: 14.2 MB (80.67%) - LeetHub

Author: ericgitangu

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

@@ -0,0 +1,13 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        maximum = 0
+        for i in range(len(s)):
+            sets = set()
+            sets.add(s[i])
+            for j in range(i+1, len(s)):
+                if s[i] != s[j] and s[j] not in sets:
+                    sets.add(s[j])
+                else:
+                    break
+            maximum = len(sets) if len(sets) > maximum else maximum
+        return maximum