BS-12. Koko Eating Bananas

Problem Link: bit.ly/3CmCKVI
Notes/C++/Java/Python codes: takeuforward.org/binary-searc...
We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Introduction of Course

[@--Blood--Prince--]

I see Koko is on a high carb diet😀😅

[@prernagupta7729]

😂

[@SreeCharan-dx7oc]

🤣🤣

[@dumpster-jackson]

Gay

[@omkarshendge5438]

lmao but tbh koko is a monkey i think thats why he is eating bananas!

[@kumarvansh007]

@@dumpster-jackson wtf

[@vm1662]

Great tip! Whenever there is a possible range of answers then we can apply binary search.. Thanks a lot Striver!

[@pradyumnmulegaon385]

for those who are solving in leetcode the TotalH should be long long and also the CalculatetotalHours should also be long long type otherwise it will throw an error .....
hope it is helpful

[@socify4410]

it was throwing run time error earlier. i thought i must be missing some edge case . after this change it got submitted. thanks to you buddy

[@tanishagarwal5992]

Why to calculate total hours just check if it any instance the req time crosses h... Return false

[@user-sm7zo5zd9t]

When I was submitting my code, I encountered the same problem, Thanks buddy.

[@tusharkhatri2921]

Bro on LeetCode not working after 121 test cases.

[@ranjeet_sohanpal]

@@tusharkhatri2921 you can make the condition in the calculation of hour .When the time taken exceeds h, you immediately return that val and prevent the overflow

[@mathguy198]

Thanks Striver, always struggled to understand the reason behind the answer being always the low value, now it's clear as crystal, all thanks to you❤❤

[@user-eh9wd8hp4f]

never thought we could even solve this by binary search mind-blowing

[@sauravchandra10]

I remember doing this question earlier but the way you taught I am confident I can now easily solve problems like these in interviews with a clear and intuitive explanation. Understood, thanks!

[@keshav9541]

same

[@SuvradipDasPhotographyOfficial]

The wait is finally over.... Thanks a ton striver❤

[@visheshagrawal8676]

I have earlier solved the question but intuition of yours is truly amazing... Great Content 🔥🔥

[@CrazyHunk14]

thanks to your intuition I could do this question on my own using the same approach that you explained in this video without any help! kudos

[@abhaysinghrathore3192]

give this man the best teacher award in the world

[@30sunique78]

In DSA sure is this best For development check chai aur code once

[@cinime]

Understood! Wonderful explanation as always, thank you very very much for your effort!!

[@thenikhildaiya.]

I just saw the question explanation and did the brute force and binary search approach all by myself just because of your previous videos explanation. Thank you so much for this wonderful and guided course.

[@kumarshivam3661]

Bro please post the solution of code

[@thenikhildaiya.]

@@kumarshivam3661 ** Brute Force :
class Solution {
public:
int minEatingSpeed(vector& piles, int h) {

int maxHours = -1 , k = 0 ;
for(int i = 0 ; i < piles.size() ; i++)
if(piles[i] > maxHours)
maxHours = piles[i] ;
for(int i = 1 ; i

[@nostalgiccringeallhailchel3881]

how far have you progressed in 3 weeks bro pls update

[@thenikhildaiya.]

@@nostalgiccringeallhailchel3881 I did aggressive cows at last. Not good progress at all because of college exams🥲
Just revising old linked list questions I did in past.

[@nostalgiccringeallhailchel3881]

@@thenikhildaiya. Which topic is aggressive cows in?

[@ritiksoni5255]

Thankyou you so much finally able to understand the approach and logics for solving DSA!!

[@Dipanshutripathi2407]

I have no doubts after watching ur videos.

[@akashdutta1620]

this was asked in an interview I came up with this solution without solving this before.. :)

[@user-ti3bd8mp1w]

understood
Thank you striver for such an amazing explanation..

[@knowthrvdo]

logic is same as finding first occurance THANK YOU

[@RaviRavi-kt9gt]

You are just incredible ❤️🎉🎉

[@hareshnayak7302]

Understood, Thanks striver for this amazing video.

[@varun1017]

use long long to calculateTotalHours instead of int to avoid overflow

[@Surya1prakash]

Really amazing explanation 👏

[@manavsingh5919]

Thank you striver....Understood everything🙂...keep up the good work

[@padmavatishah9922]

fr?

[@AyushSharma-sd1ny]

Great explanation Striver

[@Amanali-rl9hw]

finally found when to return the low and when to return the value high

[@joeljacob4685]

Thanks so much!! I was able to solve it without watching the video !!

[@shashwatkumar6965]

Great video! Just wanted to add one thing, in the question's Constraints it's given that n

[@sukhii0220]

just include the overflow condition in finding the hrs in the loop only if totalH >H break;

[@AnmolGupta-oj4lm]

Understood Very Well!

[@Jus-chill]

Understood
Please do upload videos consistently 😊

[@ShivamMaurya-fq6ws]

@striver thanks for explanation

[@abhaythakur2597]

very helpful explaination

[@ayushjaiswal7298]

Best explanation 🔥

[@Yahsaswi]

was waiting for this

[@akshaykeswani3601]

Really Amazing👏👏👏

[@NazeerBashaShaik]

Understood, thank you.

[@AdityaYadav-qf9qc]

Best explaination😍

[@user-ny6tz2rb1r]

Could you also please explain.Find K close elements with binary search.I've seen in some of the binary search approaches.Few of the solutions are with right=mid or left=mid.

[@engineerssolutionpoint95]

Nice explanation ❤

[@visheshagrawal8676]

If anyone was getting runtime error of integer overflow do change the datatype of totalhours to double or long long

[@aaranyaksantra9933]

nice explaination

[@dayashankarlakhotia4943]

Good explanation understood

[@neelnsoni1313]

Thank You

[@ravisingla9032]

Was Waiting for the same

[@harshitjaiswal9439]

Understood!

[@aniketgupta8064]

hey striver, I feel that there is some problem with the leetcode question. for the testcase [805306368, 805306368, 805306368] and h = 1000000000, the expected answer is k=3
when we use an ans variable to store the desired value of mid, the code gives output = 1 which is incorrect, however, when we simply return the low, the testcase passes.
I am not able to understand what is happening here. If this is a case of an overflow, I have already substitued long long. Pls help.

[@thegame587]

bool check(vector& piles,int h,int k){
long long ans=0;
for(int i=0;ih)return false;
}
//cout

[@aniketgupta8064]

@@thegame587 Thanks a lot buddy for replying, it's working now. I had figured the overflow problem :)

[@jayant-baid]

@@aniketgupta8064 you can also make the func dataype, totalH datatype to long, this can also works

[@aniketgupta8064]

@@jayant-baid thanks 👍

[@MYMIND252]

@@jayant-baid thank you bro i stuck in this problem for more than hour and you save me from it 😊😊

[@impalash_ag]

Hi Raj,
Both the BF and Optimal solutions will have an additional TC of O(n) to find the maximum element from the array.

[@YourCodeVerse]

Understood✅🔥🔥

[@culeforever5408]

understood 😇

[@senseiAree]

Understood ❤

[@tanishkarawat5266]

One doubt:
what if h = 5 and piles = [30,11,23,4,20]here if we take k greater than 30 then also we'll get the answer. Then how can we apply that brute force where we are taking range of k to be [1, greatest_element] in that array?

[@user-cb8ei9xp2b]

while finding maximum element in an unsorted array it takes O(n) time so ultimately the time complexity of this question is O(n).

[@prthmsh2930]

O(n*log(max) >>> O(n) :)

[@happylearning6476]

Should we not consider the + O(n) time to find the max element in the time complexity? Though i does not add to the over all complexity since we take the high value, still asking

[@aritramallik8173]

Dada tumi best❤❤❤

[@kiranmoura2974]

9:54 at this while calculating time complexity of linear approach func will run for n times .but inside it ceil function will be used jiski time complexity log n hoti h so vo consider nahi krenge?

[@user-tk2vg5jt3l]

Thank you bhaiya

[@pentapreethika4901]

can we do this by finding sum of elements in array and getting the ceil value by dividing it with number of hours which takes o(N) time complexity which is better than binary search.

[@srushtibhagchandani7255]

Understood!!

[@Anony.musk01]

understoood!!!

[@Manishgupta200]

Rather than using ceil we can use "sum = sum + (v[i] - 1)/ mid + 1;"
It's more optimal

[@shikharjoshi2998]

what's the logic behind the (v[i]-1) ??

[@HemanthD-bf4he]

Can you explain the logic?

[@user-eb4ox5zv5m]

To reduce runtime one can use instead of ceil
ans += (piles[i]+k-1)/k;

[@sateeshkumar1634]

Hey striver, i am getting 1 test case wrong in this question, don't know why
i still tried with your own code , but it is not working, nearly 3 problems have been in this way,
any one please respond....

[@hitmanop4078]

Someone please give a advice like how can u build a logic, how to revice sometimes I just go all blank even in some easy question what should I do ??.

[@pritivarse2129]

Sir plz make videos on linked list and string part from A to Z dsa sheet

[@ayushgoel01]

🔴Leetcode Solution:-
class Solution {
private:
int maxi(vector arr){
int ans = INT_MIN;
for(int i=0; i

[@jhanavikumari274]

it is actually similar to finding the smallest divisor than threshold question literally

[@yashendrabadal4776]

Koko for real is gonna shit the whole next day ! AWESOME VID STRIVER

[@srinathv1412]

Understood!!!!!

[@amaankhan9845]

Following this series. Really helpfull 💪💪

[@deeptidip9864]

Understood:)

[@pallabghosh3840]

great

[@chethanprabhu4475]

Should we not add the O(n) to time complexity to find the max element in the array

[@user-nk1mb5fy7j]

UNDERSTOOD

[@harshilpatel3205]

Understood sir 🫡🤍

[@Donquixote-Rosinante]

why this solution still falls in binary search. where we create extra memory for lowest pile 1 to highest pile 11 to get maximum pile per hour?

[@ankithac5520]

Understood

[@per.seus._]

understood

[@pihus3498]

understood :)

[@Thescienceworld652]

i was doing this wrong for three hours and what i was doing wrong was only not applying double🙂

[@VishalGupta-xw2rp]

16:50 Low opposite polarity

[@girikgarg8]

Done

[@23cash86]

Thanks++

[@ziggywiggys]

Why does it not work if I take the minimum eating speed as the minimum of the array ?

[@vatsalyasharma5585]

By what time, will the whole A2Z course will be completed?

[@RHuL706]

Hi striver, i am experience developer approx 5 years, my query is how to get calls from recruiters

[@shashankvashishtha4454]

understand

[@tejanshsachdeva487]

The typecasted leet-code code:
#include
#include
#include
class Solution {
private:
int maxEl(vector& piles) {
int maxi = INT_MIN;
for (int i = 0; i < piles.size(); i++) {
maxi = max(maxi, piles[i]);
}
return maxi;
}
long long totEl(vector& piles, int mid) {
long long totH = 0;
int n = piles.size();
for (int i = 0; i < n; i++) {
totH += (piles[i] + mid - 1) / mid; // Updated calculation
}
return totH;
}
public:
int minEatingSpeed(vector& piles, int h) {
int low = 1;
long long high = maxEl(piles);
int ans = INT_MAX;
while (low

[@rushidesai2836]

public int findHours(int[] arr, int bananaCount) {
int totalHrs = 0;
for (int i = 0; i < arr.length; i++) {
totalHrs += Math.ceil((double) arr[i] / bananaCount);
}
return totalHrs;
}
Cast to double, because ceil here needs floating-point number.

[@debanjan10]

[@arunm619]

ceil can be replaced with
x / a + ( (x % a) != 0 ? 1 : 0)

[@vrandakansal5940]

Kb tk playlist complete hogi?

[@lakshyabhati2262]

but if the array is sorted then we don't need to find max of array .. its just the last element of the array .. i guess

[@nehathakur40]

how to tackle case of overflow in total hours calculated even if we use long long to calculate for total hours required it is giving wa?

[@abhishek_dagar]

use long long toatl hours instead of int

[@sanjaysubramani4041]

Finding max will add O(n) to the time complexity.won't it?

[@durgaprasad-gn4dk]

how can we come to know that the given question is bs on answers.

[@srinathkumar9247]

Lower boundry

[@frostyfreezemovies]

I am using javascript😇

[@darven7511]

why do you return low, you didn't explained that part

[@rollercoaster9719]

binary search on answer standard question

[@abdussalam-4836]

why i feel like i am watching these videos again

[@channelcuriousity6467]

Test case 125 faiiled
out of 126

[@tarunprajapati7642]

how to quickly understand that low is pointing to answer or high?

[@abhishek_dagar]

dry run by taking 1 example