Minimum Window Subsequence: coding question

Available question text

Given strings S and T, find the shortest contiguous substring of S such that T appears as a subsequence (characters of T appear in order but not necessarily consecutively). The core challenge is efficiently locating and shrinking ordered subsequence matches in S to produce the minimum-length window.

Continue with questions that share topics or the same question type.

Minimum Cost to Remove Characters for Subsequence Avoidance
Coding
Minimum Number of Increasing Subsequence to Be Removed
Coding
Minimum Operations to Form Subsequence With Target Sum
Coding
Minimum Operations to Make a Subsequence
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

LinkedIn
Leetcode 727. Minimum Window Subsequence
Reported Mar 1, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

Minimum Window Subsequence

Available question text

Related questions

Minimum Window Subsequence

Available question text

Related questions