tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.6 KiB
1.6 KiB
TODO 0076. Minimum Window Substring hard
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:
Input: s = "ADOBECODEBANC", t = "ABC"
Output: "BANC"
Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.Example 2:
Input: s = "a", t = "a"
Output: "a"
Explanation: The entire string s is the minimum window.Example 3:
Input: s = "a", t = "aa"
Output: ""
Explanation: Both 'a's from t must be included in the window.
Since the largest window of s only has one 'a', return empty string.Constraints:
m == s.lengthn == t.length1 <= m, n <= 10^{5}sandtconsist of uppercase and lowercase English letters.
Follow up: Could you find an algorithm that runs in O(m + n) time?
TODO Approach
Write your approach here.
TODO Python
class Solution:
def minWindow(self, s: str, t: str) -> str:TODO C++
class Solution {
public:
string minWindow(string s, string t) {
}
};