DIY: Minimum Window Subsequence
We'll cover the following
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 ...
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Devpath's Terms of Service and Privacy Policy