D. J.:

- Added the leetcode problem and solution for 30 and 76

Author: nobodyPerfecZ

Diff for: README.md

@@ -41,6 +41,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [26 Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/)
 - [27 Remove Element](https://leetcode.com/problems/remove-element/description/)
 - [28 Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/)
+- [30 Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/)
 - [42 Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/description/)
 - [45 Jump Game II](https://leetcode.com/problems/jump-game-ii/description/)
 - [49 Group Anagrams](https://leetcode.com/problems/group-anagrams/description/)
@@ -55,6 +56,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [68 Text Justification](https://leetcode.com/problems/text-justification/description/)
 - [69 Sqrt(x)](https://leetcode.com/problems/sqrtx/description/)
 - [71 Simplify Path](https://leetcode.com/problems/simplify-path/description/)
+- [76 Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/description/)
 - [80 Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/)
 - [82 Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/)
 - [86 Partition List](https://leetcode.com/problems/partition-list/description/)

Diff for: awesome_python_leetcode/_30_substring_with_concatenation_of_all_words.py

@@ -0,0 +1,51 @@
+import collections
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def findSubstring(self, s: str, words: List[str]) -> List[int]:
+        """
+        You are given a string s and an array of strings words. All the strings of
+        words are of the same length.
+
+        A concatenated string is a string that exactly contains all the strings of any
+        permutation of words concatenated.
+
+        - For example, if words = ["ab","cd","ef"], then "abcdef", "abefcd", "cdabef",
+        "cdefab", "efabcd", and "efcdab" are all concatenated strings. "acdbef" is not
+        a concatenated string because it is not the concatenation of any permutation
+        of words.
+
+        Return an array of the starting indices of all the concatenated substrings in s.
+        You can return the answer in any order.
+        """
+        needCount = collections.defaultdict(int)
+        res = []
+
+        for word in words:
+            needCount[word] += 1
+
+        wordLen = len(words[0])
+        windowLen = len(words) * wordLen
+        for left in range(len(s) - windowLen + 1):
+            haveCount = collections.defaultdict(int)
+            right = left
+
+            while right < left + windowLen:
+                word = s[right : right + wordLen]
+
+                if word not in needCount:
+                    break
+
+                haveCount[word] += 1
+
+                if haveCount[word] > needCount[word]:
+                    break
+
+                right += wordLen
+
+            if right == left + windowLen:
+                res.append(left)
+        return res

Diff for: awesome_python_leetcode/_76_minimum_window_substring.py

@@ -0,0 +1,43 @@
+import collections
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def minWindow(self, s: str, t: str) -> str:
+        """
+        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.
+        """
+        if len(s) < len(t):
+            return ""
+
+        haveCount = collections.defaultdict(int)
+        needCount = collections.defaultdict(int)
+        for c in t:
+            needCount[c] += 1
+
+        have, need = 0, len(needCount)
+        res, resLen = [-1, -1], float("infinity")
+        left, right = 0, 0
+        while left < len(s) and right < len(s):
+            c = s[right]
+            haveCount[c] += 1
+            if c in needCount and haveCount[c] == needCount[c]:
+                have += 1
+            while have == need:
+                if (right - left + 1) < resLen:
+                    res = [left, right]
+                    resLen = right - left + 1
+                c = s[left]
+                haveCount[c] -= 1
+                if c in needCount and haveCount[c] < needCount[c]:
+                    have -= 1
+                left += 1
+            right += 1
+        left, right = res
+        return s[left : right + 1] if resLen != float("infinity") else ""

Diff for: tests/test_30_substring_with_concatenation_of_all_words.py

@@ -0,0 +1,21 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._30_substring_with_concatenation_of_all_words import (
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["s", "words", "expected"],
+    argvalues=[
+        ("barfoothefoobarman", ["foo", "bar"], [0, 9]),
+        ("wordgoodgoodgoodbestword", ["word", "good", "best", "word"], []),
+        ("barfoofoobarthefoobarman", ["bar", "foo", "the"], [6, 9, 12]),
+    ],
+)
+def test_func(s: str, words: List[str], expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    sub_strings = Solution().findSubstring(s, words)
+    assert sub_strings == expected

Diff for: tests/test_76_minimum_window_substring.py

@@ -0,0 +1,17 @@
+import pytest
+
+from awesome_python_leetcode._76_minimum_window_substring import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["s", "t", "expected"],
+    argvalues=[
+        ("ADOBECODEBANC", "ABC", "BANC"),
+        ("a", "a", "a"),
+        ("a", "aa", ""),
+    ],
+)
+def test_func(s: str, t: str, expected: str):
+    """Tests the solution of a LeetCode problem."""
+    minWindow = Solution().minWindow(s, t)
+    assert minWindow == expected