Skip to content

Latest commit

 

History

History
23 lines (12 loc) · 499 Bytes

problem.md

File metadata and controls

23 lines (12 loc) · 499 Bytes

Problem 76: Minimum Window Substring

Difficulty: Hard

Problem

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

Note:

If there is no such window in S that covers all characters in T, return the empty string "".

If there is such window, you are guaranteed that there will always be only one unique minimum window in S.

Example

Input: S = "ADOBECODEBANC", T = "ABC"
Output: "BANC"