Koko Eating Bananas - Leetcode 875 - Binary Search (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@ParthPatel-xb2cn]

def koko(eating_capacity): if eating_capacity 1000: return "Koko has transcended to MONSTER status" else: return "Koko is... in a mysterious state”

[@servantofthelord8147]

I’ve said it before and I’ll say it again - you are such a gifted teacher!

[@GregHogg]

Thank you so much!!

[@zhihangcheng1083]

Hello, I’ve recently started learning binary search and have encountered several challenges. I often struggle with deciding whether to use while l

[@Johnson_Amah]

Hey Greg. I found that l

[@younis533]

I would have liked and illustrated explanation to the tech you used at the end, also wouldnt checking if a k works then checking k-1 doesnt work then that k is my answer

[@SeanKearney-g7d]

god dam you killed this Greg

[@SeanKearney-g7d]

well done

[@christianjt7018]

Amazing solution! thanks for sharing

[@zhihangcheng1083]

Great video! But I believe that the slowest speed could be optimized to math.ceil(sum(piles) / h), not 1

[@FaberLSH]

Thank you so much!

[@xiranli3239]

You are amazing❤

[@GregHogg]

Thank you!

[@DivineEdoka]

My question is why is binary search working even when the arrray is unsorted

[@GregHogg]

We're not binary searching the array, we're searching the space for k

[@mumuuheibjf]

while solving this problem I am craving bananas 🤣

[@lakshyamathur8808]

what does the function k_works return?? what is meant by if k_works(k) ??

[@GregHogg]

True if k works, false otherwise

[@moonlight-td8ed]

it return True if monkey can eat k number of bananas in a pile in time