727. Minimum Window Subsequence

Let dp[j][e] = s be the largest index for which S[s:e+1] has T[:j] as a substring.