123. Minimum Window Substring
HardString algorithms
Return the shortest substring of s that contains every character of t, including repeats (if t has two "a"s, the window needs two). If several shortest windows exist, return the leftmost. Return an empty string if no window exists.
Example 1
Input: s = "ADOBECODEBANC", t = "ABC" Output: "BANC"
Constraints
1 ≤ s.length, t.length ≤ 10⁵Characters are ASCII letters