KOKO EATING BANANAS | PYTHON | LEETCODE # 875

[@AaAaAaA-mm7cc]

Following your approach in your ships and cutting ribbons videos, this question felt so easy to solve, had a hard time making the code work, but it felt satisfying when it worked, I can't believe how well I advanced just by following your explanations! Honestly thanks for all these videos!

[@crackfaang]

I'm really glad you're getting value out of these videos and you can see your Leetcode skills improving. Please do let me know if there's any other topics/problems you'd like me to make videos for

[@fahadm443]

This is freaking awesome. I never understood binary search this well. Watched the other two videos similar to this as well. One thing will be awesome for your channel is a series on binary search.

[@crackfaang]

Thanks for the kind words! Yes I agree, I definitely need to do more binary search videos as well as a basic explanation of the general use algorithm

[@peelyt3shorts113]

Bro you're so underrated , I love the way you're explaining the problem. I'm gonna recommend to my friends

[@crackfaang]

Thanks and glad you enjoyed the video!

[@MinhNguyen-lz1pg]

Your explaination of max(piles) is very intuitive, after understanding that, everything just click haha. Thanks a ton!

[@LastVoyage]

If we init right to max(piles) wouldn't it make sense to init left to max(min(piles)//h, 1)? Am I missing something here?

[@slimysnail6071]

You are a legend who simplify pb this much:)

[@lolboy94]

Your videos should have more views!

[@crackfaang]

I know right, I agree! 😂

[@subee128]

Thanks

[@pranavtripathi4181]

Amazing explanation 👏 Appreciate it.

[@dnm9931]

Thank you AGAIN !!!

[@miyakakinshasa25]

could you give an example for case for when mid is the right answer hence making right = mid - 1 would make us miss the solution? I don't get why mid ==right. Thanks so much! Lovely video

[@SriHarshaBolisetti]

Keep up the great job :)

[@crackfaang]

Thanks! Keep watching the videos 😉