Minimum Window Subsequence - Video Solutions

HardStringDynamic ProgrammingSliding Window

LeetCode was HARD until I Learned these 15 Patterns

13:001,002,140 views

10 video solutions available

Minimum Window Subsequence - Video Solution

Watch 10 video solutions for Minimum Window Subsequence, a hard level problem involving String, Dynamic Programming, Sliding Window. This walkthrough by Ashish Pratap Singh has 1,002,140 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.

Problem Statement

Given strings s1 and s2, return the minimum contiguous substring part of s1, so that s2 is a subsequence of the part.

If there is no such window in s1 that covers all characters in s2, return the empty string "". If there are multiple such minimum-length windows, return the one with the left-most starting index.

Example 1:

Input: s1 = "abcdebdde", s2 = "bde"
Output: "bcde"
Explanation: 
"bcde" is the answer because it occurs before "bdde" which has the same length.
"deb" is not a smaller window because the elements of s2 in the window must occur in order.

Example 2:

Input: s1 = "jmeqksfrsdcmsiwvaovztaqenprpvnbstl", s2 = "u"
Output: ""

Constraints:

1 <= s1.length <= 2 * 10⁴
1 <= s2.length <= 100
s1 and s2 consist of lowercase English letters.

Read full problem with examples

Continue Learning

Practice this problem

Solve it on FleetCode

Read Solution & Explanation

Detailed text walkthrough

Minimum Window Subsequence - Video Solutions

LeetCode was HARD until I Learned these 15 Patterns

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist

Minimum Window Substring: Utilizing Two Pointers & Tracking Character Mappings With A Hashtable

Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode

Minimum Window Substring | Sliding Window | LeetCode

Sliding Window Approach | Longest Continuous Increasing Subsequence | LeetCode 674.

Minimum Window Substring | Google | Leetcode 76

Minimum Window Subsequence | Leetcode 727

LeetCode 727. Minimum Window Subsequence

Minimum Window Subsequence - Video Solution

Problem Statement

Continue Learning

Minimum Window Subsequence - Video Solutions

LeetCode was HARD until I Learned these 15 Patterns

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist

Minimum Window Substring: Utilizing Two Pointers & Tracking Character Mappings With A Hashtable

Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode

Minimum Window Substring | Sliding Window | LeetCode

Sliding Window Approach | Longest Continuous Increasing Subsequence | LeetCode 674.

Minimum Window Substring | Google | Leetcode 76

Minimum Window Subsequence | Leetcode 727

LeetCode 727. Minimum Window Subsequence

Minimum Window Subsequence - Video Solution

Problem Statement

Continue Learning