Available question text
Given a source string, a pattern that is a subsequence of source, and a sorted list of removable indices, find the maximum number of characters you can delete (from those indices) while keeping pattern as a subsequence of source. This is typically solved by testing whether pattern survives after removing a candidate set of indices (commonly via binary search on k and a greedy subsequence check).
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 3316. Find Maximum Removals From Source String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source