Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 2565. Subsequence With the Minimum Score
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source