DIY: Minimum Window Subsequence
Solve the interview question "Minimum Window Subsequence" in this lesson.
Problem statement
Given strings s
and t
, find the minimum (contiguous) substring w
of s
, so that t
is a subsequence of ...
Solve the interview question "Minimum Window Subsequence" in this lesson.
Given strings s
and t
, find the minimum (contiguous) substring w
of s
, so that t
is a subsequence of ...