Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3316. Find Maximum Removals From Source String
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).
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.