We’re preparing your current view and syncing the latest data.
Given two strings s and t, return the minimum window in s which will contain all the characters in t. If there is no such window in s that covers all characters in t, return an empty string "".
Note that if there is such a window, it is guaranteed that there will always be only one unique minimum window in s.
Two strings s and t.
A string representing the minimum window substring of s containing all characters of t.
1 <= s.length, t.length <= 10^5 s and t consist of English letters.
Example 1
Input
s = "ADOBECODEBANC", t = "ABC"
Output
BANC
Explanation
The minimum window substring that contains all characters A, B, and C is "BANC".