DIY: Minimum Window Subsequence

Problem statement

Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W.

If there is no window in S that covers ...