Minimum Window Substring

Problem

Smallest window in s containing all characters of t (with multiplicity); empty if none.

Example

s="ADOBECODEBANC", t="ABC" -> "BANC"

Constraints

• 1 ≤ |s|,|t| ≤ 10^5

Approach

Sliding window with a need/have counter. O(n).