Minimum Window Subsequence

Given strings s and t, print the shortest contiguous substring of s that contains t as a subsequence. If several have the same length print the one that starts earliest. Print an empty line if there is none.

1 <= len(s) <= 2 * 10^4 1 <= len(t) <= 100