250. Minimum Window Substring

Hard · Sliding Window

Given strings `s` and `t`, return the minimum window substring of `s` such that every character in `t` (including duplicates) is included. Return "" if no such window exists.

Examples

Example 1
Input: s="ADOBECODEBANC", t="ABC"
Output: "BANC"
Explanation: Minimum window containing A, B, C

Constraints

• 1 ≤ s.length ≤ 10⁵, 1 ≤ t.length ≤ t.length