72. Minimum Window Substring
HardSliding Window
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.
Examples
Input: ADOBECODEBANC ABC
Output: BANC
Explanation: Public test case for Minimum Window Substring
Constraints
- m == s.length
- n == t.length
- 1 <= m, n <= 10^5
- s and t consist of uppercase and lowercase English letters.
Loading...
Run checks all cases above. Submit evaluates all test cases.