problem: 0076. Minimum Window Substring

Author: flynnpark

Diff for: solutions/solution_0076/README.md

@@ -0,0 +1,36 @@
+# 0076. [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/description/?envType=study-plan-v2&envId=top-interview-150)
+
+Given two strings `s` and `t` of lengths `m` and `n` respectively, return _the **minimum window substring** of s such that every character in t **(including duplicates)** is included in the window._ If there is no such substring, return the empty string `""`.
+
+The testcases will be generated such that the answer is `unique`.
+
+### **Example 1:**
+
+<pre><code><strong>Input:</strong> s = "ADOBECODEBANC", t = "ABC"
+<strong>Output:</strong> "BANC"
+<strong>Explanation:</strong> The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.
+</code></pre>
+
+### **Example 2:**
+
+<pre><code><strong>Input:</strong> s = "a", t = "a"
+<strong>Output:</strong> "a"
+<strong>Explanation:</strong> The entire string s is the minimum window.
+</code></pre>
+
+### **Example 3:**
+
+<pre><code><strong>Input:</strong> s = "a", t = "aa"
+<strong>Output:</strong> ""
+<strong>Explanation:</strong> Both 'a's from t must be included in the window.
+Since the largest window of s only has one 'a', return empty string.
+</code></pre>
+
+### **Constraints:**
+
+- `m == s.length`
+- `n == t.length`
+- <code>1 <= m, n <= 10<sup>5</sup></code>
+- `s` and `t` consist of uppercase and lowercase English letters.
+
+**Follow up:** Could you find an algorithm that runs in `O(m + n)` time?

Diff for: solutions/solution_0076/__init__.py

@@ -0,0 +1,2 @@
+class Solution:
+    def minWindow(self, s: str, t: str) -> str: ...

Diff for: solutions/solution_0076/test_solution.py

@@ -0,0 +1,49 @@
+from typing import TypedDict
+
+import pytest
+
+from . import Solution
+
+
+class InputDict(TypedDict):
+    s: str
+    t: str
+
+
+class CaseDict(TypedDict):
+    input: InputDict
+    expected: str
+
+
+test_cases: list[CaseDict] = [
+    {
+        'input': {
+            's': 'ADOBECODEBANC',
+            't': 'ABC',
+        },
+        'expected': 'BANC',
+    },
+    {
+        'input': {
+            's': 'a',
+            't': 'a',
+        },
+        'expected': 'a',
+    },
+    {
+        'input': {
+            's': 'a',
+            't': 'aa',
+        },
+        'expected': '',
+    },
+]
+
+
+@pytest.mark.parametrize(
+    'test_case',
+    test_cases,
+)
+def test_solution(test_case: CaseDict):
+    result = Solution().minWindow(**test_case['input'])
+    assert result == test_case['expected']