for most of the videos on youtube, I still got confused even I finished watching. But for yours, I already understand it half way through. Great explanation! please make more
I totally agree with you. This was one of those questions that got me stressing out just by reading it. I watched several videos (including NeatCode) but still did not understand until I got to this video.
Hi Michael, just a little mistake i noticed @ 13:27 since you decrease right at mid -1 which should be 3 instead of 4, then left would be greater than right: no need to go further since left is the answer. Thank you very much for your great explanation.
I cannot possibly understand how someone can be so good at explaining stuff. You are the greatest youtuber of all times in terms of explaining stuff. Your channel is also underrated. You deserve a lot more subscribers and views. Please continue to make solutions to leetcode medium/hard problems.
Really Thx Michael, That's really helpful. Actually I'm fully confused about this question at the beginning. after this video, I just feel that this question is so easy. Really Thx
Thanks for the explanation!!! I'm trying to run this code right now, and its passing all test cases but one. I copied your code line by line. Is this happening for anyone else?
Michael, thank you so much for the video. One question, does your solution fail now? It seems they added a new testcase in which your solution doesn't work but it passes all the other testcases
Yes. It is beacause the hours variable may exceed the max limit during adding in the canEat method. Just use h to minus and then compare h with 0. And then it works for all test cases.
The reason why we return `left` at the end is because if left and right become equal, that means the answer MUST be `left` since that is the last possible choice.
The whole point of a binary search is to find our answer in the range of [left, right] in an efficient way. Restricting our range to the max of the number is a way to optimize the range we have to look through. The array contains piles of bananas and we are trying to find the min K, thus the max in our array would be the most that koko could eat in a day.
@@AlgosWithMichael how do we come up with the logic to return the left pointer always ? At the end of while loop : left = right = mid If canEatInTime is true for this mid , then break and return left if its false , we increase left to the next possible value left = mid + 1 ( since left == mid , its basically left++ ) and return the left + 1 value . How is it guaranteed that the next left+1 will always give the solution ?
for most of the videos on youtube, I still got confused even I finished watching. But for yours, I already understand it half way through. Great explanation! please make more
I appreciate that, I'm glad you found it useful!
I totally agree with you. This was one of those questions that got me stressing out just by reading it. I watched several videos (including NeatCode) but still did not understand until I got to this video.
Thank you so much for doing these videos! You walk us through every thinking process that is very important for beginners.
Hi Michael, just a little mistake i noticed @ 13:27 since you decrease right at mid -1 which should be 3 instead of 4, then left would be greater than right: no need to go further since left is the answer.
Thank you very much for your great explanation.
Thank you for the high-quality video! One of my favorite youtubers for leetcode questions. Keep up the amazing work ^^
I cannot possibly understand how someone can be so good at explaining stuff. You are the greatest youtuber of all times in terms of explaining stuff. Your channel is also underrated. You deserve a lot more subscribers and views. Please continue to make solutions to leetcode medium/hard problems.
i am getting error
Thanks for your video. Clear explanations and I like you walking through the codes with examples, which is really helpful!
I'm glad it's helpful, thank you for watching!
Excellent explanation. In the first go itself I could absorb it entirely
meanwhile somebody interviewed Zoomers asking 'Who the first person to land on the sun was', they said "Oo! Niel A-Armstrong!?"
Very nicely explained
Thanks 👍
Thank you for such an amazing explanation! Please keep uploading such videos :)
Really Thx Michael, That's really helpful. Actually I'm fully confused about this question at the beginning. after this video, I just feel that this question is so easy. Really Thx
Great Explanation. Cleared my doubts of this problem. Thanks.
Glad to hear! Every problem has a pattern
Your channel should be added to the curriculum to prepare for coding interviews
Very well explained, love from Indian🇮🇳
Thanks!
super explanation. Best coding channel for leetcode problems :)
Thanks a lot!
Really helped a lot!! 🍻 keep making such amazing content! God bless!
Thank you! Will do!
great video thank you so much! Keep doing the awesome work!
Thank you! Will do!
it's really a clear explanation. thanks!
Awesome, thank you for watching!
great explanation brother u r great solve more famous problems.
Thanks man, glad it helped you!
Thanks for the explanation!!!
I'm trying to run this code right now, and its passing all test cases but one. I copied your code line by line. Is this happening for anyone else?
Why are we returning left pointer and not right or mid?
Thanks for the video. Can you please do more videos on similar questions?
Sure thing!
Michael, thank you so much for the video. One question, does your solution fail now? It seems they added a new testcase in which your solution doesn't work but it passes all the other testcases
Yes. It is beacause the hours variable may exceed the max limit during adding in the canEat method. Just use h to minus and then compare h with 0. And then it works for all test cases.
@@jiecheng.x1306 @Jiecheng .x Thanks! I have a similar issue when h is really big and I fix it with ur method
Can someone explain a little more why we return 'left' at the end?
The reason why we return `left` at the end is because if left and right become equal, that means the answer MUST be `left` since that is the last possible choice.
crystal clear ..
Awesome!
Can you reiterate why right=max(nums)?
The whole point of a binary search is to find our answer in the range of [left, right] in an efficient way. Restricting our range to the max of the number is a way to optimize the range we have to look through. The array contains piles of bananas and we are trying to find the min K, thus the max in our array would be the most that koko could eat in a day.
canEatInTime is the hardest part for me
Yea, it can be a bit confusing, but that part is how many binary search problems can be solved.
Great explanation.... You could have used math.ceil
Yea true
Can We return mid instead of left?
No, it has to be left because mid is inside of our while loop and doesn't have scope outside of it.
@@AlgosWithMichael how do we come up with the logic to return the left pointer always ?
At the end of while loop : left = right = mid
If canEatInTime is true for this mid , then break and return left
if its false , we increase left to the next possible value left = mid + 1 ( since left == mid , its basically left++ ) and return the left + 1 value . How is it guaranteed that the next left+1 will always give the solution ?