Search
⌘K
Get Premium
Leetcode 2565. Subsequence With the Minimum Score
Given strings s and t (lengths up to 1e5), find the minimum length of a contiguous substring of t to remove (score = removed length, or 0 if none) so that the remaining characters of t become a subsequence of s. This is equivalent to matching prefixes and suffixes of t into s and minimizing the gap (deleted interval) between them.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.