hardSliding Window Pattern

Minimum Window Substring

Given two strings `s` and `t`, 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 "".

Examples

Input:s = "ADOBECODEBANC", t = "ABC"

Output:"BANC"

Explanation: The minimum window substring "BANC" includes A, B, and C from string t.

Hints (0/3)

Try to solve it first! Click "Reveal Next Hint" if you get stuck.

Your Code:

Results:

Output

Click "Run" to execute your code