...

/

Minimum Window Subsequence

Minimum Window Subsequence

Try to solve the Minimum Window Subsequence problem.

Statement

Given two strings, str1 and str2, find the shortest substring in str1 such that str2 is a subsequence of that substring.

A substring is defined as a contiguous sequence of characters within a string. A subsequence is a sequence that can be derived from another sequence by deleting zero or more elements without ...

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy