Minimum window substring
Given strings s and t, return the shortest substring of s that contains every character of t, counting repeats, or an empty string if there is none. Grow the window until it covers t, then shrink it from the left.
No answer yet. Write the first one; the best answer gets endorsed.