Maximum Number of Removable Characters
Find the largest number of leading removals that still leaves p as a subsequence of s. The visual crosses out removed positions in s and runs a two-pointer match for each candidate count, searched by binary steps.