Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Master Data Structures & Algorithms For FREE at AlgoMap.io!
I’ve said it before and I’ll say it again - you are such a gifted teacher!
Thank you so much!!
O my god! this is amazing . thank you sir. I have watch 2 videos before even tried myself . After watching this I successfully understand it.
def koko(eating_capacity): if eating_capacity 1000: return "Koko has transcended to MONSTER status" else: return "Koko is... in a mysterious state”
koko is overthinking this, just eat and be happy and leave us out of it
Hey Greg. I found that l
Hello, I’ve recently started learning binary search and have encountered several challenges. I often struggle with deciding whether to use while l
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
Amazing solution! thanks for sharing
Great video! But I believe that the slowest speed could be optimized to math.ceil(sum(piles) / h), not 1
god dam you killed this Greg
well done
Thank you so much!
You are amazing❤
Thank you!
what does the function k_works return??what is meant by if k_works(k) ??
True if k works, false otherwise
it return True if monkey can eat k number of bananas in a pile in time
while solving this problem I am craving bananas 🤣
My question is why is binary search working even when the arrray is unsorted
We're not binary searching the array, we're searching the space for k
Master Data Structures & Algorithms For FREE at AlgoMap.io!
I’ve said it before and I’ll say it again - you are such a gifted teacher!
Thank you so much!!
O my god! this is amazing . thank you sir. I have watch 2 videos before even tried myself . After watching this I successfully understand it.
def koko(eating_capacity):
if eating_capacity 1000:
return "Koko has transcended to MONSTER status"
else:
return "Koko is... in a mysterious state”
koko is overthinking this, just eat and be happy and leave us out of it
Hey Greg. I found that l
Hello, I’ve recently started learning binary search and have encountered several challenges. I often struggle with deciding whether to use while l
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
Amazing solution! thanks for sharing
Great video! But I believe that the slowest speed could be optimized to math.ceil(sum(piles) / h), not 1
god dam you killed this Greg
well done
Thank you so much!
You are amazing❤
Thank you!
what does the function k_works return??
what is meant by if k_works(k) ??
True if k works, false otherwise
it return True if monkey can eat k number of bananas in a pile in time
while solving this problem I am craving bananas 🤣
My question is why is binary search working even when the arrray is unsorted
We're not binary searching the array, we're searching the space for k