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).