Minimum Window Substring

Given strings s and t, print the smallest substring of s that contains every character of t (including duplicates). Print an empty line if no such substring exists. The answer is unique.

1 <= len(s), len(t) <= 10^5 English letters