Your code here...
I have tried this q :Aquamoon and Stolen String
And wrote the following code:
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
You are making vector ar of size 100005*30 T times
So if T is large your code will TLE
So make the vector ar only of size m as you are using no more
Ohh yes Thanx Alot. I didn't knew that... Thanx bro
You are making your vector ar T times and each time you are making it of size 100005*30
So your time complexity is O(T*100005*30)