sir getting 17 as output instead of 5
please check the code:
Rainwater harvest
Your code time complexity is O(n2). n can be upto 1e6.
Store maximum right and maximum left for every index in one go.
Then just use min( left[i] , right[i] ) - a[i];
Refer this for better understanding-:
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.