D. J.:

- Added the leetcode problem and solution for 3 and 209

Author: nobodyPerfecZ

README.md

@@ -15,7 +15,7 @@
             <img src="https://img.shields.io/badge/tests-passed-brightgreen">
         </a>
         <a>
-            <img src="https://img.shields.io/badge/coverage-96%25-brightgreen">
+            <img src="https://img.shields.io/badge/coverage-97%25-brightgreen">
         </a>
     </h1>
 </div>
@@ -26,6 +26,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 
 - [1 Two Sum](https://leetcode.com/problems/two-sum/description/)
 - [2 Add Two Numbers](https://leetcode.com/problems/add-two-numbers/description/)
+- [3 Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/)
 - [6 Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion/description/)
 - [9 Palindrome Number](https://leetcode.com/problems/palindrome-number/description/)
 - [11 Container With Most Water](https://leetcode.com/problems/container-with-most-water/description/)
@@ -103,6 +104,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [202 Happy Number](https://leetcode.com/problems/happy-number/description/)
 - [205 Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/description/)
 - [207 Course Schedule](https://leetcode.com/problems/course-schedule/description/)
+- [209 Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)
 - [210 Course Schedule](https://leetcode.com/problems/course-schedule-ii/description/)
 - [219 Contains Duplicates II](https://leetcode.com/problems/contains-duplicate-ii/description/)
 - [222 Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/description/)

awesome_python_leetcode/_209_minimum_size_subarray_sum.py

@@ -0,0 +1,24 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
+        """
+        Given an array of positive integers nums and a positive integer target, return
+        the minimal length of a subarray whose sum is greater than or equal to target.
+        If there is no such subarray, return 0 instead.
+        """
+        curVal, minLen = 0, float("inf")
+        left, right = 0, 0
+        while left < len(nums) and right < len(nums):
+            curVal += nums[right]
+            if curVal < target:
+                right += 1
+            else:
+                minLen = min(minLen, right - left + 1)
+                curVal -= nums[right]
+                curVal -= nums[left]
+                left += 1
+        return minLen if minLen < float("inf") else 0

awesome_python_leetcode/_3_longest_substring_without_repeating_characters.py

@@ -0,0 +1,23 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        """
+        Given a string s, find the length of the longest substring without duplicate
+        characters.
+        """
+        maxLen, curLen, charToPos = 0, 0, {}
+        left, right = 0, 0
+        while left < len(s) and right < len(s):
+            c = s[right]
+            if c not in charToPos or charToPos[c] < left:
+                charToPos[c] = right
+                curLen += 1
+                right += 1
+            else:
+                pos = charToPos[c]
+                maxLen = max(maxLen, curLen)
+                curLen -= pos + 1 - left
+                left = pos + 1
+                del charToPos[c]
+        return max(maxLen, curLen)

tests/test_209_minimum_size_subarray_sum.py

@@ -0,0 +1,18 @@
+from typing import List
+import pytest
+
+from awesome_python_leetcode._209_minimum_size_subarray_sum import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["target", "nums", "expected"],
+    argvalues=[
+        (7, [2, 3, 1, 2, 4, 3], 2),
+        (4, [1, 4, 4], 1),
+        (11, [1, 1, 1, 1, 1, 1, 1, 1], 0),
+    ],
+)
+def test_func(target: int, nums: List[int], expected: int):
+    """Tests the solution of a LeetCode problem."""
+    min_size = Solution().minSubArrayLen(target, nums)
+    assert min_size == expected

tests/test_3_longest_substring_without_repeating_characters.py

@@ -0,0 +1,19 @@
+import pytest
+
+from awesome_python_leetcode._3_longest_substring_without_repeating_characters import (
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["s", "expected"],
+    argvalues=[
+        ("abcabcbb", 3),
+        ("bbbbb", 1),
+        ("pwwkew", 3),
+    ],
+)
+def test_func(s: str, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    max_length = Solution().lengthOfLongestSubstring(s)
+    assert max_length == expected