How to optimise this code as I am getting TLE?
Mike and OR tree problem
@nayakashutosh99,
Complexity of your code is O(n^2), no amount t of optimisation would be enough. Try to do it in O(n)
Can you give some hint to solve in O(n)?
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.
Sorry forgot to provide the feedback