Merge pull request #6 from codewithme-py/feat/longest-substring-without-repeating-characters-0003

problem solution & test 0003

Author: codewithme-py

display_runtime.txt

@@ -0,0 +1 @@
+0

solutions/longest_substring_without_repeating_characters_0003.py

@@ -0,0 +1,13 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        if not s:
+            return 0
+        left_border, max_len = 0, 0
+        actual_set = set()
+        for right_border, char in enumerate(s):
+            while char in actual_set:
+                actual_set.remove(s[left_border])
+                left_border += 1
+            actual_set.add(char)
+            max_len = max(max_len, right_border - left_border + 1)
+        return max_len

tests/test_longest_substring_without_repeating_characters_0003.py

@@ -0,0 +1,16 @@
+import pytest
+
+from solutions.longest_substring_without_repeating_characters_0003 import Solution
+
+
+@pytest.mark.parametrize("args, expected", [
+    ("abcabcbb", 3), ("bbbbb", 1), ("pwwkew", 3), ("", 0), ("a", 1),
+    ("au", 2), ("dvdf", 3), ("tmmzuxt", 5), ("anviaj", 5), ("ohvhjdml", 6),
+    ("qrsvbspk", 5), ("", 0), ("a", 1), ("au", 2), ("dvdf", 3),
+    ("tmmzuxt", 5), ("anviaj", 5), ("ohvhjdml", 6), ("qrsvbspk", 5),
+    ("", 0), ("a", 1), ("au", 2), ("dvdf", 3), ("tmmzuxt", 5),
+    ("anviaj", 5), ("ohvhjdml", 6), ("qrsvbspk", 5),
+])
+def test_solution(args: str, expected: int) -> None:
+    sol = Solution()
+    assert sol.lengthOfLongestSubstring(args) == expected