Find the number of pairs (i, j) such that after removing a substring S[i, j] from S, string T still remains a subsequence of S
A similar Problem Cf problem
Find the number of pairs (i, j) such that after removing a substring S[i, j] from S, string T still remains a subsequence of S
A similar Problem Cf problem