Merge pull request #14 from codewithme-py/feat/minimum-size-subarray-sum-0209

Feat/minimum size subarray sum 0209

Author: codewithme-py

problems_cache.json

@@ -19183,5 +19183,115 @@
     "Delayed Count of Equal Elements",
     "Medium",
     "delayed-count-of-equal-elements"
+  ],
+  "4216": [
+    "Weighted Word Mapping",
+    "Easy",
+    "weighted-word-mapping"
+  ],
+  "4137": [
+    "Number of Prefix Connected Groups",
+    "Medium",
+    "number-of-prefix-connected-groups"
+  ],
+  "4062": [
+    "House Robber V",
+    "Medium",
+    "house-robber-v"
+  ],
+  "4209": [
+    "Palindromic Path Queries in a Tree",
+    "Hard",
+    "palindromic-path-queries-in-a-tree"
+  ],
+  "4212": [
+    "Toggle Light Bulbs",
+    "Easy",
+    "toggle-light-bulbs"
+  ],
+  "4217": [
+    "First Element with Unique Frequency",
+    "Medium",
+    "first-element-with-unique-frequency"
+  ],
+  "4221": [
+    "Longest Almost-Palindromic Substring",
+    "Medium",
+    "longest-almost-palindromic-substring"
+  ],
+  "4204": [
+    "Maximum Subarray XOR with Bounded Range",
+    "Hard",
+    "maximum-subarray-xor-with-bounded-range"
+  ],
+  "4170": [
+    "Total Distance to Type a String Using One Finger",
+    "Medium",
+    "total-distance-to-type-a-string-using-one-finger"
+  ],
+  "4224": [
+    "Find the Score Difference in a Game",
+    "Medium",
+    "find-the-score-difference-in-a-game"
+  ],
+  "4226": [
+    "Check Digitorial Permutation",
+    "Medium",
+    "check-digitorial-permutation"
+  ],
+  "4044": [
+    "Maximum Bitwise XOR After Rearrangement",
+    "Medium",
+    "maximum-bitwise-xor-after-rearrangement"
+  ],
+  "4065": [
+    "Count Sequences to K",
+    "Hard",
+    "count-sequences-to-k"
+  ],
+  "4250": [
+    "Maximum Requests Without Violating the Limit",
+    "Medium",
+    "maximum-requests-without-violating-the-limit"
+  ],
+  "4231": [
+    "Smallest Pair With Different Frequencies",
+    "Easy",
+    "smallest-pair-with-different-frequencies"
+  ],
+  "4013": [
+    "Merge Close Characters",
+    "Medium",
+    "merge-close-characters"
+  ],
+  "4219": [
+    "Minimum Operations to Make Array Parity Alternating",
+    "Medium",
+    "minimum-operations-to-make-array-parity-alternating"
+  ],
+  "4239": [
+    "Sum of K-Digit Numbers in a Range",
+    "Hard",
+    "sum-of-k-digit-numbers-in-a-range"
+  ],
+  "4229": [
+    "Trim Trailing Vowels",
+    "Easy",
+    "trim-trailing-vowels"
+  ],
+  "4024": [
+    "Minimum Cost to Split into Ones",
+    "Medium",
+    "minimum-cost-to-split-into-ones"
+  ],
+  "4161": [
+    "Minimum Bitwise OR From Grid",
+    "Medium",
+    "minimum-bitwise-or-from-grid"
+  ],
+  "4002": [
+    "Count Subarrays With K Distinct Integers",
+    "Hard",
+    "count-subarrays-with-k-distinct-integers"
   ]
 }

solutions/minimum_size_subarray_sum_0209.py

@@ -0,0 +1,16 @@
+class Solution:
+    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 contiguous subarray of which the sum is
+        greater than or equal to target.
+        If there is no such subarray, return 0.
+        """
+        left_mark, current_sum, min_length = 0, 0, float('inf')
+        for right_mark in range(len(nums)):
+            current_sum += nums[right_mark]
+            while current_sum >= target:
+                min_length = min(min_length, right_mark - left_mark + 1)
+                current_sum -= nums[left_mark]
+                left_mark += 1
+        return 0 if min_length == float('inf') else min_length

tests/test_minimum_size_subarray_sum_0209.py

@@ -0,0 +1,14 @@
+import pytest
+
+from solutions.minimum_size_subarray_sum_0209 import Solution
+
+
+@pytest.mark.parametrize('target, nums, expected', [
+    (7, [2, 3, 1, 2, 4, 3], 2),
+    (4, [1, 4, 4], 1),
+    (1, [1, 1, 1, 1, 1, 1, 1, 1], 1),
+    (11, [1, 1, 1, 1, 1], 0)
+])
+def test_min_subarray_len(target: int, nums: list[int], expected: int) -> None:
+    sol = Solution()
+    assert sol.minSubArrayLen(target, nums) == expected