Minimum window subsequence

Given strings s and t, return the minimum (contiguous) substring w of s such that t is a SUBSEQUENCE of w. If there is no such window, return the empty string. If multiple minimum-length windows exist, return the one with the left-most starting index. 1 <= len(s) <= 2*10^4, 1 <= len(t) <= 100.