Leetcode 727. Minimum Window Subsequence
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.