Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
sir in the most optimised code , you put the condition , where height[l]> leftmax , then we can directly write leftmax = height[l] instead of math.max function as the if statement is checking that only
Haha. Yeah, you are 100% correct. There was no need of Math.max, thanks for pointing it 👍
😂😂❤❤❤❤
Amazing Explanation Just Darun ❤🎉
tagda explanation bhai....bdiya
Thank you so much bhaiya these series is very much valuable ..!!
Very good explanation bhaiya keep doing the good work...
Great Explanation
awesome bhaiya maza aa gaya
Thank you sir
I am struggling with this question for almost a year ! I m scare to take it up! But after this video it is my least caring question.
pls zoom out krke questions kre sir aage k saare videos mai
Bro how to get thought process
❤❤
please Explain the 10th april leetcode daily challenge problem i.e problem no. 950
keep it up
sir in the most optimised code , you put the condition , where height[l]> leftmax , then we can directly write leftmax = height[l] instead of math.max function as the if statement is checking that only
Haha. Yeah, you are 100% correct. There was no need of Math.max, thanks for pointing it 👍
😂😂❤❤❤❤
Amazing Explanation Just Darun ❤🎉
tagda explanation bhai....bdiya
Thank you so much bhaiya these series is very much valuable ..!!
Very good explanation bhaiya keep doing the good work...
Great Explanation
awesome bhaiya maza aa gaya
Thank you sir
I am struggling with this question for almost a year ! I m scare to take it up! But after this video it is my least caring question.
pls zoom out krke questions kre sir aage k saare videos mai
Bro how to get thought process
❤❤
please Explain the 10th april leetcode daily challenge problem i.e problem no. 950
keep it up