BS-12. Koko Eating Bananas

[@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

[@vm1662]

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

[@LokeshPandey-m1m]

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

[@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

[@ArunsinghParihar-j3j]

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❤❤

[@--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

[@visheshagrawal8676]

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

[@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?

[@akashdutta1620]

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

[@lshuarckyma]

STRIVERS TIP always find out the range ie low and high for applying the binary search bcz it could even work for larger ranges but will be efficient for the lowest high or the highest low. TIP 2 the pointers high and low always end up at opposite polarity of the condition ie for ex here POINTER low from being the speed in which eating in time isnt possible end up to possible minimum so without using the ANS directly use the POINTERS

[@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

[@SuvradipDasPhotographyOfficial]

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

[@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.

[@ArdentMusicLover]

Thank you, Striver. Loved the intuition on "binary search on answers" and on how to pick low or high as final answer. One quick suggestion: The python code provided in the solution is INCORRECT because ceil computation needs to be float.

[@ritiksoni5255]

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

[@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;

[@Dipanshutripathi2407]

I have no doubts after watching ur videos.

[@Bigg_boss_trolls]

Thanks a lot Striver!

[@Amanali-rl9hw]

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

[@knowthrvdo]

logic is same as finding first occurance THANK YOU

[@varun1017]

use long long to calculateTotalHours instead of int to avoid overflow

[@ayushgoel01]

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

[@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?

[@cinime]

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

[@visheshagrawal8676]

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

[@AtulKumar-c4x7l]

understood Thank you striver for such an amazing explanation..

[@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

[@Jus-chill]

Understood Please do upload videos consistently 😊

[@debanjanghosal618]

I solved this problem but I cant get over 1 doubt? Why are we setting low to 1? Won't it be better if we set low as the minimum number of bananas among all the piles?

[@rahulreddyambati9065]

A typical De-Shaw intern OA question

[@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 😊😊

[@joeljacob4685]

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

[@DikshaNarang-q9l]

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) :)

[@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.

[@hareshnayak7302]

Understood, Thanks striver for this amazing video.

[@Shikaslad-s5f]

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

[@Surya1prakash]

Really amazing explanation 👏

[@manavsingh5919]

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

[@padmavatishah9922]

fr?

[@abdussalam-4836]

why i feel like i am watching these videos again

[@tanujaSangwan]

Solved this without watching the video myself

[@AyushSharma-sd1ny]

Great explanation Striver

[@abhaythakur2597]

very helpful explaination

[@RaviRavi-kt9gt]

You are just incredible ❤️🎉🎉

[@aritramallik8173]

Dada tumi best❤❤❤

[@yashendrabadal4776]

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

[@AnmolGupta-oj4lm]

Understood Very Well!

[@arvindokram2906]

Got asked this question today!

[@jhanavikumari274]

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

[@Thescienceworld652]

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

[@pradipkumarmukhi]

Understood Man You damn it!!!

[@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....

[@aaranyaksantra9933]

nice explaination

[@harshitjaiswal9439]

Understood!

[@ShivamMaurya-fq6ws]

@striver thanks for explanation

[@A_Myth963]

For people doing on leetcode and getting error after testcase 120 ...just use long long hrtaken and also return long long.. Here's the code if someone needs it class Solution { public: long long hrtaken(vector pi, int h) { long long hr = 0; for (auto i : pi) { hr += ceil((double)i/(double)h); } return hr; } int minEatingSpeed(vector& piles, int h) { int maxt = -1; int m = -1; for (auto i : piles) m = max(m, i); int low = 1, high = m; while (low

[@srinivasareddychalla-i2o]

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.

[@culeforever5408]

understood 😇

[@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

[@umangkumar2005]

little explanation solve the whole question #include using namespace std; bool fun(vector & v,int h ,int &ans, int mid){ int sum=0; for(int i=0;ih){ return true; } } ans=mid; return false; } int minimumRateToEatBananas(vector v, int h) { int ma=INT_MIN; for(int i=0;i

[@AdityaYadav-qf9qc]

Best explaination😍

[@pritivarse2129]

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

[@_CodeLifeChronicles_]

i got a q same like this in uber where hours were same but here it is a car and we need to find min kwperh so that the cars can get charged . but right now i am in my third year and gave uber in the beginning of the year and i didnt have any idea abt this. thank go i am on a strict plan of action now hope i will be able to solve q next time in OA

[@ayushjaiswal7298]

Best explanation 🔥

[@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?

[@akshaykeswani3601]

Really Amazing👏👏👏

[@akashgite905]

koko needs to stop eating those bananas

[@dayashankarlakhotia4943]

Good explanation understood

[@NazeerBashaShaik]

Understood, thank you.

[@AnilKumar-mg8sj]

Thanks!

[@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 ??.

[@neelnsoni1313]

Thank You

[@chethanprabhu4475]

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

[@debhagaming]

Nice explanation ❤

[@yashraj5898]

to clear all the test cases . class Solution { public: int findmaxelement(vector& piles){ int maximum = INT_MIN; int n = piles.size(); for (int i=0; i

[@gnanaphanideep6398]

Understood😁

[@oyeesharme]

understood bhaiya

[@YourCodeVerse]

Understood✅🔥🔥

[@frostyfreezemovies]

I am using javascript😇

[@Learnprogramming-q7f]

Thank you bhaiya

[@debanjan10]

[@DeadPoolx1712]

UNDERSTOOD;

[@Yahsaswi]

was waiting for this

[@Aryan-j7i2b]

understood!!!

[@ravisingla9032]

Was Waiting for the same

[@VishalGupta-xw2rp]

16:50 Low opposite polarity

[@sumitdon2004]

striver is best

[@harshilpatel3205]

Understood sir 🫡🤍

[@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

[@per.seus._]

understood

[@farzadkhan3813]

Understood!!

[@amarsharma8582]

**IMPORTANT** For CEIL VALUE you can use (a+b-1)/b this works well. example: arr = 2 3 6 8 mid = some value X then ceil value = (arr[i] + mid - 1)/mid

[@senseiAree]

Understood ❤

[@girikgarg8]

Done

[@shashankvashishtha4454]

understand

[@AbhishekBhattacharjee-j2m]

UNDERSTOOD

[@amaankhan9845]

Following this series. Really helpfull 💪💪

[@ziggywiggys]

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

[@abhishek_dagar]

Leetcode solution all test cases passed : class Solution { public: int findmaximum(vector &piles){ int n = piles.size(); int maxi = INT_MIN; for(int i =0; i

[@vrandakansal5940]

Kb tk playlist complete hogi?