Trapping Rainwater Problem | Leetcode #42
VloĆŸit
- Äas pĆidĂĄn 24. 03. 2021
- This video explains a very important programming interview problem which is the trapping rainwater problem.In this problem, given an array representing elevation map, we are required to find the amount of water the elevation map can trap.I have explained all the approaches for solving this problem starting from the bruteforce approach to the most optimal approach.I have shown how we can process and highly optimize the time complexity.
CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
======================================PLEASE DONATE=============================
𧥠SUPPORT OUR WORK: / techdose
đ UPI-ID: surya.kahar@ybl
đJOIN Membership: / @techdose4u
==============================================================================
INSTAGRAM : / surya.pratap.k
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithTECHDOSE
TELEGRAM Group LINK: t.me/joinchat/SRVOIxWR4sRIVv5...
=======================================================================
USEFUL LINKS:
đ Must do TIPS to ACE Virtual Interview: âą đŽMust do Tips to ACE y...
đąBest strategy to excel your coding interview: âą đŽBest strategy to exce...
đĄGet your dream job in 1 month: âą đŽGet your dream job in...
đ”How to crack dream job in just 2 months: âą How to crack dream job...
đŁ7 Days DSA plan: techdose.co.in/7-days-dsa-che...
RELATED LINKS:
Maximum of all subarrays of size K: âą Maximum of all subarra...
Perfect Subarray: âą Perfect subarray | Goo...
CODE LINK: techdose.co.in/trapping-rainw...
This is one of the best explanations I've seen so far on the internet.
Thanks :)
Your patience while explaining is quite appreciable
Thanks :)
Hands down the best explanation on youtube... Better than top creators.
This might be the longest video on your channel. Very well covered. Thank you :)
Welcome
i did not even notice. Time flies.
@@abhilashpatel3036 Absolutely, Time flies, but leaves its shadow behind.
After finding ur videos, i never watch any other channel.... i super like how u explain stuff, and different improved ways to solve it. thank you man!
Welcome :)
great video sir, i had come to understand the O(1) space solution, and your explanation is shorter and much much crisper than anyone else's. keep up the great work.
Dang man, you made a Leetcode Hard problem seem like an Easy. Subscribed :)
đđŒ
Hehehe, I was thinking the same thing. Some people are natural teachers.
Best video on internet for Trapping Rain water.. I wouldn't have understood this problem if I hadn't found this video... Kudos for the great explanation....
Hands down the best explanation of this problem on the internet. đđ
Generally dont prefer commenting unless really impressed. This was a great solution and I could code very easily myself. thanks for all the effort spent.
Welcome :)
An incredibly detailed and amazing presentation. Thank you!
Your channel is really great! You should definitely have more subscriber than most of other creators who create useless roadmaps.
You sir, did an awesome job breaking this down and making it simpler to understand. Thank you for your efforts. Appreciate it
Awesome explanation, covering all cases with detail and clarity!
Thanks đ
It's rare to have a video with zero downvotes! great explanation.
Thanks
Happy Teacher's day. Really appreciate you as a teacher.
The solution of this problem is very simple but the way sir tells how to approach a problem is amazing .
:)
This is hands down the best explanation I have seen for this question. I am surprised it doesn't have many views!
Thanks
Best explanation ever with best level of calmness and patience đđ
giving all three possible solutions u make life easy. Thanks a lot
The best explanation for the problems, Ty sir for ur patience and amazing explanations
Thanks a ton for explaining solution in detail. It's really a tough job. Keep it up!!!
You are the best. I am now sharing with my friends!!
One of the best explanations! Thanks a lot!
Welcome :)
Your explanation resolved all my doubts and i was able to write code by myself after watching your video for 10 minutes.
Thank you
Thanks đ
Nicely explained step by step, appreciated it, understood the approach in one go...you deserve more subs & views...hope you will reach there ..:)
Thanks â€ïž
No one explains like this.
Loved your videos
Thanks đ
So far the best explaination. Thank you so much sir.
Thanks for this beautiful video, your explanation made me code myself... At the end of 16 min of the video, I understood and coded in python.
You Deserve more than a million subscribers for such a great content!
Thanks :)
Thank you for this video! I appreciate you drawing out the base cases and explaining everything in detail. This is definitely the most helpful video for this problem :)
Champ tech doseđ đ
Well done
I watched many videos to understand the concept of two pointer approach.. But after watching this video, It became so clear to me.... Next time if I am unable to solve any question I will come to this channel first... This is a very underrated channel..
Thanks :)
thankyou so much for this video! you just made this hard task quite easy.
thank you for this, this is extremely well explained
Thanks
Excellent explanation!
Your channel will definitely grow a lot
Thanks đ
Most underrated channel
Great work
Keep going đ
Techdose to me is a game changer
Nice Explanation! Thanks!
Thanks alot! I was struggling to understand the logiv but now its clear
Great
Clear explanation!! Thanks bro
I've watched many of your videos. Your explanations are always very easy to understand. Thank you for creating these videos; you are doing so much good.
thanks :)
Awesome Explanation, better from other CZcamsrs
Thanks đ
Great video sir!! What an explanation! Keep uploading such videos đđ
Welcome :)
Really good explanation! Thanks a lot.
awesome explanation, the way you explained corner cases are great. keep it up
Welcome :)
Awesome explanation . Even kids can understand after watching this video. Thank you very much
Welcome đ
This saved my day :-) Thank you very much
:)
Great explanation, thank you.
When the content is so good, subscribing and liking are on autopilot.
very clear explanation!
This was an excellent explanation.
loved that o(1) space method
you made it easy. Thank you.
Great explanation!
TC =O(n)
SC =O(1)
=> 24:25
superb explaination
Thanks đ
great explanation !!
The last solution where time-O(N) and space-O(1) method is amazing. Came here after many leetcode solutions!
Thank you so much you explained these questions by previously known methods because others are making it very complicated for reducing code size()
Welcome :)
amazing explanation bro!
Top notch explanation đ
Thank you so much for doing this on my request.... best bro...
Welcome :)
Right at 21:35 I stopped and boom my code got accepted, thanks a lot bhai, I was trying to solve with 2 pointer approach as well but couldn't deal with the water-level stuff, which you made so easy to understand and grasp, and not just that also for improvising code in such an awesome way with 2N Auxiliary space. Again thanks a lot bhai
Nobody cares thou...keep coding
excellent explanation. awesome solution.
In every Questions , too much concept as well as hidden cases . When i want to try same questions after 4 days or a week i got stuck but your explanation make question easier for me. ::))
Great :)
thank you for your explain , from simple solution to better solution !
Welcome đ
Excellent Explanation
Great explanation man,do more
sir you explained very nicely step by step đđđ
This was amazingđ„ł
I bet this vdo has got the best explanation for the two pointer approach...thanks a ton TechDoseđ
Welcome đ
Very good explanation
nicely covered thank you
Just explained it calmly loved that.đ€
Thanks
Great explanation sir..hope expecting more videos from tech dose..
Sure. I will keep uploading :)
Thank you , Just THANK YOU
brooooooooooooooooo best explaination ever
Thanks :)
Great explanation
Thanks a lot Sir!
I had seen your video of solving the area of histogram ..so first thing came in my mind to take 2 stacks to get left and right max ...while writing the code I realized that I can solve this without stack .... after that I saw your complete video and got o(1) space method ... this is crazy
đ hahaha. Very nice to see you apply the concepts of my previous video :) But there is always someone better than you đ
@@techdose4u =D =D
Best solution explaination to this problem. đ
Thanks :)
Very well explained sir , your explanation for this question is crystal clear. I really liked this problem it was very intuitive
Thanks :)
very nice. thank you
Nice explanation.
Index starts from 1 to arr.len-1
Totalwater+=Math.min(leftmax of current index element, rightmax of current index element)-current index element
Nice 1 liner :)
You are very easy and nice to understand.
Thanks âșïž
Best explanation sir. Thank you
Welcome :)
You are legend đ„đ„đ„
amazing crystal clear
explaination
Thanks
Best explanation
Thanks a lot!
Very nice explanation đthank youu
Welcome đ
Simply Amazing!!
Thanks âșïž
Ur patience is appreciable
Thanks :)
Nice explanation. Thanks!
Welcome :)
Nice explanation sir......you are doing a great job
Thanks :)
Such a great explanation
thanks :)
what a coincidence that we both were working on the same problem.
:O
Best Explanation.
Thanks