akash.garg2172's blog

By akash.garg2172, history, 4 months ago, In English
Your code here...

I have tried this q :Aquamoon and Stolen String

And wrote the following code:


As per what I can observe my code is O(n*m) and in the q its mentioned that It is guaranteed that n is odd and that the sum of n⋅m over all test cases does not exceed 10^5.

But still my code is giving TLE in test case 2.

plz help me with its complexity

Read more »

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