BS-12. Koko Eating Bananas
Vložit
- čas přidán 20. 06. 2023
- 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
I see Koko is on a high carb diet😀😅
😂
🤣🤣
Gay
lmao but tbh koko is a monkey i think thats why he is eating bananas!
@@dumpster-jackson wtf
Great tip! Whenever there is a possible range of answers then we can apply binary search.. Thanks a lot Striver!
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
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
Why to calculate total hours just check if it any instance the req time crosses h... Return false
When I was submitting my code, I encountered the same problem, Thanks buddy.
Bro on LeetCode not working after 121 test cases.
@@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
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❤❤
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!
same
I have earlier solved the question but intuition of yours is truly amazing... Great Content 🔥🔥
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
The wait is finally over.... Thanks a ton striver❤
never thought we could even solve this by binary search mind-blowing
Understood! Wonderful explanation as always, thank you very very much for your effort!!
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.
Bro please post the solution of code
@@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
how far have you progressed in 3 weeks bro pls update
@@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.
@@thenikhildaiya. Which topic is aggressive cows in?
give this man the best teacher award in the world
In DSA sure is this best For development check chai aur code once
Thankyou you so much finally able to understand the approach and logics for solving DSA!!
understood
Thank you striver for such an amazing explanation..
I have no doubts after watching ur videos.
use long long to calculateTotalHours instead of int to avoid overflow
You are just incredible ❤️🎉🎉
logic is same as finding first occurance THANK YOU
this was asked in an interview I came up with this solution without solving this before.. :)
Really amazing explanation 👏
Understood, Thanks striver for this amazing video.
Thanks so much!! I was able to solve it without watching the video !!
finally found when to return the low and when to return the value high
Great video! Just wanted to add one thing, in the question's Constraints it's given that n
just include the overflow condition in finding the hrs in the loop only if totalH >H break;
Understood Very Well!
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.
Thank you striver....Understood everything🙂...keep up the good work
fr?
Great explanation Striver
@striver thanks for explanation
Understood
Please do upload videos consistently 😊
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
very helpful explaination
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?
Best explanation 🔥
was waiting for this
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?
Best explaination😍
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.
Nice explanation ❤
Understood, thank you.
Hi Raj,
Both the BF and Optimal solutions will have an additional TC of O(n) to find the maximum element from the array.
Really Amazing👏👏👏
Thank You
If anyone was getting runtime error of integer overflow do change the datatype of totalhours to double or long long
Good explanation understood
nice explaination
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 ??.
while finding maximum element in an unsorted array it takes O(n) time so ultimately the time complexity of this question is O(n).
O(n*log(max) >>> O(n) :)
Should we not add the O(n) to time complexity to find the max element in the array
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?
Understood!
To reduce runtime one can use instead of ceil
ans += (piles[i]+k-1)/k;
Was Waiting for the same
Thank you bhaiya
Sir plz make videos on linked list and string part from A to Z dsa sheet
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....
Why does it not work if I take the minimum eating speed as the minimum of the array ?
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.
bool check(vector& piles,int h,int k){
long long ans=0;
for(int i=0;ih)return false;
}
//cout
@@thegame587 Thanks a lot buddy for replying, it's working now. I had figured the overflow problem :)
@@aniketgupta8064 you can also make the func dataype, totalH datatype to long, this can also works
@@jayant-baid thanks 👍
@@jayant-baid thank you bro i stuck in this problem for more than hour and you save me from it 😊😊
it is actually similar to finding the smallest divisor than threshold question literally
ceil can be replaced with
x / a + ( (x % a) != 0 ? 1 : 0)
Understood ❤
understood 😇
Understood✅🔥🔥
Rather than using ceil we can use "sum = sum + (v[i] - 1)/ mid + 1;"
It's more optimal
what's the logic behind the (v[i]-1) ??
Can you explain the logic?
Dada tumi best❤❤❤
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?
use long long toatl hours instead of int
By what time, will the whole A2Z course will be completed?
Hi striver, i am experience developer approx 5 years, my query is how to get calls from recruiters
Finding max will add O(n) to the time complexity.won't it?
Understood!!
how can we come to know that the given question is bs on answers.
understood
understoood!!!
why do you return low, you didn't explained that part
Kb tk playlist complete hogi?
Understood
Can anyone explain why we have use double while using ceil function?
#include
using namespace std;
int main() {
int ans = ceil(4/(double)3);
cout
how to quickly understand that low is pointing to answer or high?
dry run by taking 1 example
great
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
Following this series. Really helpfull 💪💪
understand
16:50 Low opposite polarity
UNDERSTOOD
why low started from 1
Understood!!!!!
Done
i was doing this wrong for three hours and what i was doing wrong was only not applying double🙂
Understood:)
Understood sir 🫡🤍
Thanks++
understood :)
Lower boundry
Why mid can't be our ans , why low
🔴Leetcode Solution:-
class Solution {
private:
int maxi(vector arr){
int ans = INT_MIN;
for(int i=0; i
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.
binary search on answer standard question
Koko for real is gonna shit the whole next day ! AWESOME VID STRIVER
What to do if the totalH value exceeds int limits ?
use long long instead of using int
Actually I was looking for this.....when will the totalH value exceed int limit, can you explain me?
@@lucario404 #include
#include
#include
class Solution {
public:
int minEatingSpeed(vector& piles, int h) {
int s = 1;
sort(piles.begin(), piles.end());
int ans = 0;
int n = piles.size() - 1;
int e = piles[n];
while (s