You are given a string source, a string pattern, and an integer array targetIndices sorted in ascending order.

You can choose to remove characters from source at indices present in targetIndices.

Return the maximum number of indices from targetIndices that can be removed such that pattern remains a subsequence of source after all removals.

Constraints:

• $1 \le n =$ source.length $\le 3 imes 10^3$

• $1 \le$ pattern.length $\le n$

• $1 \le$ targetIndices.length $\le n$

• targetIndices is sorted in ascending order.

• targetIndices contains distinct elements in the range $[0, n - 1]$.

• source and pattern consist only of lowercase English letters.

• pattern is guaranteed to be a subsequence of source.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.