Rain water harvesting problem

#1
#2

Your code will give TLE, since the constraints are pretty high 10^6. Try first storing all the left[i] in O(N) and then right[i] in O(N) and then again iterate to take the min - a[i] of them.
@yyashu123

#3

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.