avinash007's blog

By avinash007, history, 4 years ago, In English

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

  • Vote: I like it
  • -1
  • Vote: I do not like it