Trapping Rain Water | O(N) Time complexity and O(N) Space Complexity Geeksforgeeks Leetcode Solution

This is the video under the series of DATA STRUCTURE & ALGORITHM. We are going to solve Questions from GeeksforGeeks or Leetcode Trapping Rain Water in O(N) Time Complexity and O(N) Space complexity. Given an array arr[] of N non-negative integers representing the height of blocks at index I as Ai where the width of each block is 1. Compute how much water can be trapped in between blocks after raining.
Which is a very famous and Routine question asked in Interview. The question is from the Topics Data structure. A full easy concept in Hindi. This is Question is asked in Many companies like Google, Amazon, Oyo Rooms, Paytm, Samsung, Adobe, etc..
We also Provide courses on Competitive Programming and Data structure. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------
► Homework Question: leetcode.com/p...
----------------------------------------------------------------------------------------
► Trapping Rain Water: practice.geeks...
► Trapping Rain Water: leetcode.com/p...
► PDF of Trapping Rain Water: github.com/Pri...
► CODE of Trapping Rain Water: github.com/Pri...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
----------------------------------------------------------------------------------------
►Our Playlists on:-
►Competitive Programming : • How to start Competiti...
►C++ Full Course : • L-01 || Introduction a...
►Algorithms : • L-01 || Prefix Sum Arr...
►Data Structure : • Data Structures with C...
------------------------------------------------------------------------
Our Students Contacts Form:-
Form link: docs.google.co...
------------------------------------------------------------------------
#interview_preparation #geeksforgeeks #Hindi

[@khanf13]

Your slow and soft way of explaining is really pleasent to hear!

[@gokulnaathb2627]

Exactly😭💖

[@satvikkhare1844]

If I want to look for any solution for DS questions, default YT channel is yours. If it is not available, then I look for other channels. Please don't stop making DS question videos. One of the best solutions,

[@CSBDPSAHITHIRANI]

Wow such an elegant solution without using any stacks and all. Thank you so much!!

[@HelloWorldbyprince]

Keep learning buddy ❤️ And sharing my channel with your friends and colleagues

[@maheshnv4848]

I think We can solve this in o(1) space using two pointer approach lmax,rmax=arr[0],arr[-1] l,r=0,n-1 Count=0 While l

[@CodingWithPrakash_]

Yes

[@shivangitiwari8252]

The way you explain is great , so systematic with proper concepts and explanations . Literally loved your videos.

[@HelloWorldbyprince]

Thanks Shivangi for such a wonderful appreciation

[@rdxgaurav3483]

Bhai itna aaram se samjhate ho na hard problem bhi acche se samajh ata hai, Really you have this art.

[@HelloWorldbyprince]

Thanks yaar 😍

[@kuldeepsingh-oz4om]

@@HelloWorldbyprince but after two years(i.e now ) this solution show error :- " Segmentation Fault (SIGSEGV) " i.e it has to be more optimized

[@rupeshjha4717]

One of the best explanations! Please continue making such videos sir!

[@HelloWorldbyprince]

Sure buddy

[@RavindraKadam-ri4xp]

you are explaining very well, till now I have watched only 2 videos of you both are having hard questions but when I saw your video. I thought is it hard, no because you explained it very well hence it became an easy question for me.

[@shaikkhajamohiddin4035]

till now i have seen 5 videos regarding this concept but no such video has a good explanation like urs video.........bhai we need this type of explanation like explaining the question properly and the concept behind it and finally code explanation.....keep it up bro do the upcoming videos like this, its a request!!! Thank you bro

[@mithileshsharma6878]

same bro

[@abhijeetghubade994]

Thank you soo much, I liked the way you thought to improve the time complexity. Great Explanation. Thank you soo much. I have watched all your videos

[@HelloWorldbyprince]

Thanks for your support ... Please keep sharing with your friends

[@rajjaiswal8768]

bhaiya i think u are the most underrated youtuber in this field, i have watched your playlist on hashing and it really helped me a lot and some on BST, thanks bhaiya , RESPECT for you.

[@subhajitpaul1260]

Really clear explanation 😍

[@HelloWorldbyprince]

Thanks buddy

[@shreyankshrestha9274]

samjha diya bhai bahut bahut sukriya .

[@namankumarsharma5195]

Good explanation for solving this question in O(n) 👍🔥 . I had tried to solve this in O(n) but my program was give wrong output on some testcase.

[@HelloWorldbyprince]

Thanks a lot please share my channel with your friends

[@sarahdaniel6862]

Thank you so much!! The explaination of the logic and code is very clear. 👏👏

[@HelloWorldbyprince]

Thanks 😊 Keep sharing with your friends

[@ankitvijay8985]

Great explanation ✨

[@HelloWorldbyprince]

Thanks a lot yaara ❤️

[@abhishekkumaryadav652]

Now I am get the complete concept of trapping rain water thanks sir

[@HelloWorldbyprince]

Kindly share my channel with your friends and on social media

[@arkabhattacharya7743]

Your explanation is the best for beginners keep it up!!!

[@HelloWorldbyprince]

Thanks a lot buddy 😀

[@magic.pencil2.0]

Very neat explanetion broo. Keep uploading such videos. Thanks

[@HelloWorldbyprince]

Keep watching

[@ankushladani496]

Samaj me aa gaya bhaiya...💯💯

[@alfiyazahra4680]

aa gaya bhaiya samjh I really appreciate ur efforts

[@vidyamusic6794]

u make things really very easy for us thanks again

[@HelloWorldbyprince]

Thanks a lot

[@Rajnish-pu8mj]

sir you are a gem !!!!!!

[@mitpatel2420]

bhai explaination level is op

[@user-pj8vx3tf1m]

Excellent Explationation 🎉🎉

[@HelloWorldbyprince]

Thanks a lot

[@khanf13]

BEST SOLUTION ON THE WEB FOR THIS QUESITONS !!!!!! Wow bhai i am ur fan ! tysm

[@faizalam355]

U should do it in O(1) in space complexity

[@HelloWorldbyprince]

ok i will try this also

[@SagarDas-le8if]

Very Thanks bhaiya The way you explain concept that it amazing , other also do this but you are unique 🙃😀

[@HelloWorldbyprince]

Thank you so much 😀

[@shashwatsingh253]

Dhanyavad Bhaiya For Great Explanation of O(n) approach . . . .

[@HelloWorldbyprince]

Keep sharing my channel ❤️❤️ in your social media group

[@shashwatsingh253]

@@HelloWorldbyprince Jii Bhaiya Sure

[@manishreddy9799]

perfect explanantion hatsoff

[@HelloWorldbyprince]

Thanks a lot buddy

[@kamalsingh1345]

Great 👍👍👍❤

[@Shishu819]

this man izz simply great!!!

[@HelloWorldbyprince]

Thanks a lot

[@tarunbehera934]

thank you so much for solving tough problems like this in the easiest way possible.🙏🙏

[@aqsaaqeel8665]

Nice explanation

[@HelloWorldbyprince]

Thanks 😊

[@ANUJKUMAR-fu4bk]

Whenever I'm unable to solve any problem. I'm searching on HW Because here I get best solution 👍.

[@suhelali4547]

thanks a lot sir

[@HelloWorldbyprince]

Keep learning buddy 😊 Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@akshita5472]

Good explanation👍👍

[@ritikadhangar2979]

thankyou so much sir😇😇😇😇😇

[@AmanKumar-sf7zi]

Got it sir...

[@HelloWorldbyprince]

Great buddy

[@pallavi_10]

u r the best thank u

[@HelloWorldbyprince]

You're welcome!

[@MindFlayer3012]

SUCH A NICE EXPLAINATION BHAIYA

[@HelloWorldbyprince]

Thanks a lot

[@rhythmmahale4183]

very clear explanation

[@HelloWorldbyprince]

Keep watching

[@rdxgaurav3483]

Please also make video on Container with most water , leetcode problem

[@HelloWorldbyprince]

okay sure i will

[@090_srishtigaur8]

finally smjh aa gya

[@nikhilsatyam4815]

bhaiya samjh me aagya 😀😀

[@peacefulpeace9572]

great work sir

[@HelloWorldbyprince]

Thanks bhai Bass share kardo channel ko aap mere motivation ke liye 🥰

[@sakshamsinha6436]

Great explaination ,Sir❤️🙏

[@HelloWorldbyprince]

Keep sharing with your friends

[@uniqueshivam]

Thankyou for your awesome explaination.🔥 Keep it up👍👍

[@AJAYKumaryadav-fj2lc]

Great

[@entertainmentworld5276]

Thank you so much!!

[@utsavkumarmalviya5041]

Very well explain

[@HelloWorldbyprince]

Thanks for liking

[@adityagulhane7271]

bohot sahi bhai!!!

[@HelloWorldbyprince]

Thanks Aditya Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@PPP-7061]

Nice

[@premprakashsahu7923]

You are great 🙌🙌🙌

[@HelloWorldbyprince]

Thanks 😊😊

[@kuldeepsingh-oz4om]

@@HelloWorldbyprince but after two years(i.e now ) this solution show error :- " Segmentation Fault (SIGSEGV) " i.e it has to be more optimized

[@sanyamshaw7584]

I am confused. We are using two arrays lmax and rmax doesn't that implies space complexity is O(2N)

[@HelloWorldbyprince]

yess but it is considere as O(N)

[@kuldeepsingh-oz4om]

@@HelloWorldbyprince but after two years(i.e now ) this solution show error :- " Segmentation Fault (SIGSEGV) " i.e it has to be more optimized

[@satvikkhare1844]

Goldman Sachs asked the same question when it visited our campus

[@mithileshsharma6878]

bhai apko ek youtube channel shuru krna chaiye uspr video dalni chaiye ap smjhate bhot vdia ho

[@kashmiramathur8673]

absolutely great efforts...hats off

[@HelloWorldbyprince]

Thanks a lot

[@ishitasrivastava6976]

Wonderful

[@HelloWorldbyprince]

Thank you! Cheers!

[@dhanashreegaikwad6560]

Great explanation!!

[@Aman-dx1vl]

thankyou sir..

[@HelloWorldbyprince]

Most welcome Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@darshankalathiya8667]

Grat sir..

[@HelloWorldbyprince]

nice bro

[@sujoyseal195]

Kaafi achha explanation hai

[@sukhjeetkaur15]

👍👍

[@omkarmore6167]

Bhaiya bahut badiya.....keep it up !!!!!!!!!!!!!!!!

[@HelloWorldbyprince]

Keep sharing with your friends ❤️

[@Sudhirkumar-sz3pu]

Bhaiya bhot maja aa gya 😎😎 thank you 🙏🙏

[@HelloWorldbyprince]

Thanks a lot Please , if possible then share this channel in your college, groups or linkedin becoz it's cost nothing to you 😀

[@kuldeepsingh-oz4om]

@@HelloWorldbyprince but after two years(i.e now ) this solution show error :- " Segmentation Fault (SIGSEGV) " i.e it has to be more optimized

[@nimssinha5373]

Nice explanation brother✌

[@Maheshwaripremierleague]

maza aagya solve krke

[@HelloWorldbyprince]

Thanks yaar ❤️ please share and support my channel

[@SOURAVKUMAR-di4xg]

Great Work...

[@namratadhobale7051]

amazing

[@HelloWorldbyprince]

Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@KunalKashyap6]

Thanku

[@HelloWorldbyprince]

welcome

[@blackerhat]

maja aa gya

[@bhupeshpattanaik7150]

6:20 half video complete hone ke baad check kar rahe ho ki video record hori hae ya nahi ..... lol nice video , because record ho gyi hae ;-)

[@HelloWorldbyprince]

😀😀

[@divyanshgupta3126]

❤

[@suseelas9736]

is this code in priority queue

[@anuskamishra_cseiot_6035]

long long trappingWater(int arr[], int n){ // code here int water = 0; for(int i=1; i

[@harshalsangame1305]

7 8 8 2 4 5 5 1 why this input is not accepting in gfg in shows me wrong ans ?

[@HelloWorldbyprince]

Sometimes gfg shows wrong Check your code in copy == check code in local computer If same then u r right Tumhara logic sahi hai agar then fine

[@intromaker400]

Kya ye channel java ke liye suitable ha

[@chidambarjoshi3470]

bro , the videos are not properly synced with your voice ...

[@HelloWorldbyprince]

Yup ...due to my mobile 😌

[@chidambarjoshi3470]

@@HelloWorldbyprince bro can u please explain how to get summer internship at IITs in detail , I am in 5th sem and in 2021 I want to apply for internship at IIT and how to choose an area of interest...please!!

[@abhijeetghubade994]

@@chidambarjoshi3470 You can go to IIT college's websites and in the see which prof is working on what project and then you can mail them stating how you can contribute to their projects.. They might reply you and ask for an interview or talk about what he expects from you. Also, every IIT has or most of the IIT had their own program for their respective institute. You can apply through that too. The programs are kinda CGPA centric soo getting through it might be a little difficult PS - I did my 2nd year internship at IITM CSE Department by mailing. I didn't have luck with programs

[@chidambarjoshi3470]

@@abhijeetghubade994 while applying got internship at any IIT , do they really make you to explain the related projects if u have any , and letter of recommendation from HOD of our current institute , CV. Did u get internship by giving an interview to that professor?

[@abhijeetghubade994]

@@chidambarjoshi3470 I got the internship by mailing profs. The prof may or may not take an interview. It depends on the prof. My prof took an interview. Start mailing profs from December or January for summer 2021. Till then you can try to built some mini project of yours so that you have something to show him as in what you have done. Letter of recommendation isn't very necessary. If the prof asks for one, you might have to take one from your HoD. If you are planning on applying through any program, you will definitely need an LoR from one of your prof. CV is obviously needed.

[@shashanksabharwal8591]

One more day gone.. But aaj bhi koi video nahi aai 😭😭😭😭😭😭... Bhai pada do na... Dailyy k 4-5 question

[@HelloWorldbyprince]

I am glad that you are waiting for my videos ...but I feel bad...becoz my phone is not working ...but hopefully I upload my video today 😌

[@shashanksabharwal8591]

@@HelloWorldbyprince 😣😣😣 Bhai ummide mt todo yrrrr.. Itna slow video... Bhai aaj bhi nahi aai... Yr din ki 3 dal do please 🙏🙏🙏🙏🙏🙏🙏 acche acche medium level questions .. From gfg /leetcode Please 😭 Lockdown h khi coaching bhi nahi ja skta .. Please bhai.. Thoda or effort marke thodi jldi videos dalo Ye ek Iklota yt channel h jo wakai m pura code detail m smjhakr, even write bri krte ho code...

[@bhupeshpattanaik7150]

1 suggestion .... try to improve your body language and energy level of speaking , this might help you in increase your audience

[@HelloWorldbyprince]

I really appreciate your suggestions

[@dakshchandra5607]

at 132 test case this solution get wrong ans!!!!!!!!! in 2023

[@gauravparasar4571]

2 test case pass nahi hore

[@HelloWorldbyprince]

kon kon se ?

[@gauravparasar4571]

@@HelloWorldbyprince are sir password yaad agya apko 🤣

[@harshgarg2146]

error aa rhi hai

[@HelloWorldbyprince]

Pls try to see my code and ya fir code ko dry run karke dekho aap

[@harshgarg2146]

Btao kaise solve kru

[@harshgarg2146]

1 hour tk try Kiya esse bdya love babar hai best tarika se smjhta hai

[@harshgarg2146]

@@HelloWorldbyprince okk wait

[@raunakkumar6144]

bro 132 test case didnt pass long long trappingWater(int arr[], int n){ // code here int left[n]; left[0]=arr[0]; int right[n]; right[n-1]=arr[n-1]; int water_trapped=0; for(int i=1;i=0;i--) { right[i]=max(arr[i],right[i+1]); } for(int i=0;i

[@HelloWorldbyprince]

why bro ? can u please debug by dry run

[@sukritimaurya2600]

Nice explanation 🙌

[@abhishekgovind5174]

Good explanation

[@ankitvijay8985]

Great explanation ✨

[@HelloWorldbyprince]

Keep learning buddy Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀