bihariforces's blog

By bihariforces, history, 6 months ago, In English

We have a variation of this, find sum of $$$F(x)$$$ for every subsequence of a string, and should be better than $$$O(N^2)$$$.

I can only think of $$$O(N^2)$$$ approach which involves finding individual contribution of every unequal pair of characters, can we optimize this?

  • Vote: I like it
  • +16
  • Vote: I do not like it