@tarabyte.tech: Replying to @Hossein KB Full optimal O(n) solution + code is on my page. This is the last video on this problem - dynamic programming series starts next! Never thought I’d talk so much about a Leetcode problem lol. #leetcode #computerscience #softwareengineer #womenintech #techtok
I think the trick with this one is understanding what makes one container bigger than another. If you can understand that you might need to decrease the width (move a pointer inwards) in order to potentially drastically increase your height, then the trade off works.
2025-11-16 12:46:33
11
NotOnlyBlond :
Please make more videos solving leetcode🙏🏼 can’t believe TikTok knows me so well that I am on leetcode tok 😆
2025-11-16 22:33:26
3
Fayez Abusharkh :
Hello, do you have a youtube.
2025-11-16 16:51:42
3
forthevibeonly :
Go over number of distinct islands please
2025-11-15 23:47:21
8
Kiran.N :
Prefix sum is a lot simpler to understand and also optimal.
2025-11-16 11:12:48
1
Wrath Reborn :
Hey Tara keep crushing it!!!! I think you have a blue ocean with your leet code python!! Its so exciting and fun to watch your tutorials and teaching, you have such a talent for teaching leet code!!!
2025-11-16 16:32:09
2
NickCurry :
What do you think about using Monte Carlo approximation
2025-11-16 04:56:49
1
itslennysfault :
what if it's 50,000 bars wide? 50000x1=50000. keep everything the same but add 50,000 1 height bars to the right. the largest answer is the full width with 1 height. right?
2025-11-20 04:16:43
0
isha mehra :
So helpful thank you!!
2025-11-15 23:23:13
2
user85619797574535 :
the little bit challenging part is parameters passing in nested array of nested recursion
2025-12-05 08:24:03
0
pianopanda :
Great explanation, thanks!
2025-11-18 04:58:28
1
peanutnut :
The algorithm is unreal. Leetcode tok thank you lordt
2025-11-19 17:30:12
1
tarabyte :
If this is the first video you are seeing, check out the full brute force and two pointer solutions on my page. Get ready for the dynamic programming series… it’s coming next!
2025-11-15 23:19:49
3
richardlcallis :
Could take all the values and divide by their pointer value, and whatever is the max is now the left, the multiply by their pointer value and the max is now the right… this makes it so if there is a bunch of options that you can identify the optimal solution really quickly
2025-11-17 10:11:40
0
sameer :
why don't we find the two most longest bars and i guess they must have the max amount of water or material in it??
2025-11-16 19:37:05
2
To see more videos from user @tarabyte.tech, please go to the Tikwm
homepage.