Відео

Decrement krne ki vajah se hi hme freq array m end me aakr sabhi elements ki frequency milli h....ye aapko practice k sath smj aa jayega ki kha kis trah ka manipulation krke hm apne questions ko solve kr skte h

Try to run the optimized approach on GFG.

Why this not run in leetcode

This code is also running on leetcode. Only some changes are done because in Leetcode a vector is taken as argument instead of an array as in gfg. Try this: int water=0; int n = height.size(); int lmax[n], rmax[n]; lmax[0]=height[0]; for(int i=1;i<n;i++) { lmax[i] = max(lmax[i-1] , height[i]); } rmax[n-1]=height[n-1]; for(int i=n-2;i>=0;i--) { rmax[i] = max(rmax[i+1] , height[i]); } for(int i=1;i<n-1;i++) { water += (min(lmax[i],rmax[i]) - height[i]); } return water;

Thank you 🙏🏻

Thanks a lot 😊

Thank You😊😊

Glad you liked it

Glad to hear that😊

I'm glad you like it

Glad you liked it

😊

Thank you🙂

Glad you liked it!

Thank you 🙂

Glad you liked it!

Glad you like them!

Thank you

Keep watching👍