C++/Java/Python Code & Notes: drive.google.com/file/d/1ucadv9m6RjrJmGRaEMBfwgCKGFgJ46dq/view?usp=share_link And guys do share you thoughts on which approach 2 or 3, you found more Intuitional & which one was more Easy to get to 😎 !!
Best explanation on the planet for this question! Right from starting to build the intuition to land upon the optimal solution, everything was perfect.
ultimate video bhai. The best video a person can find for this question. Top notch explaination from a top notch person🔥 For me the best part was how you start from the brute force and went to the most OP solution and at the same time explaining us ur inuition behind taking those approach.
@Aryan Mittal I really appreciate your clear explanation, I can able to solve it using binary search, but I didn't think of condition you mentioned. :) I subscribed to your channel just now!
Solving problems at 6 am with a full time job , really putting in the hard work. Appreciate you ,man
Humne thori kaha ki subah uthke video daal
@@ganakkathuria4893 looking for everywhere, who asked?
@@gilfoyle2211 what do u mean?
@@ganakkathuria4893 gratitude only gratitude!!
C++/Java/Python Code & Notes: drive.google.com/file/d/1ucadv9m6RjrJmGRaEMBfwgCKGFgJ46dq/view?usp=share_link
And guys do share you thoughts on which approach 2 or 3, you found more Intuitional & which one was more Easy to get to 😎 !!
thanks for sharing. The link is not accessible.
Best explanation on the planet for this question! Right from starting to build the intuition to land upon the optimal solution, everything was perfect.
ultimate video bhai.
The best video a person can find for this question.
Top notch explaination from a top notch person🔥
For me the best part was how you start from the brute force and went to the most OP solution and at the same time explaining us ur inuition behind taking those approach.
Wo! Your Explaining skills are Brilliant
thanks . Clicking such approach requires a lot of hard work. The way you present this answer is itself very interesting. One of best explanations.
wow! Never thought binary search can be used here, increasing any previous element for ith element was lit!!
Thank you aryan for picking new question it helps a lot
Amazing! Detailed and concise explanation, proves the insight step by step with maths. This is the essence of Computer Science.
Top Notch Explaination.!
I was confused beacuse of that ceil function....ceil(a / n) = a + n - 1 / n....is such a good method....thanks for explaining it😁
Great Explanation Bhaiya
@Aryan Mittal I really appreciate your clear explanation, I can able to solve it using binary search, but I didn't think of condition you mentioned. :) I subscribed to your channel just now!
always wait for ur daily update
bro woke up at 5 am to teach us
Such a cool mathematical explanation. Thanks Man!!
Thanks bro was able to understand the explanation.... Are u releasing leetcode problems everyday
i've been solving this problem for hours. Good solution man !
great explanation.
really amazing stuff
That was amazinggg!! Keep boing bro
so this was uploaded just recently !!! I was thinking why wasn't the video showing up in searches
Thanks you so much for this video.
what are you using for writing.....?? i mean which pen tab..??
Top quality explanation thanks bro.
Man you are awesome!! Keep up the good work.
bhai brute force how will we know when to stop
Amazing explanation 🔥
in the related topic of this question, its written that this question can also be solved via dynamic programming , can u share that approach
You can use partition dp here use a for loop return min of all max
Jesus, Allah and Buddha all in one guy. I salute thee my God.
Your hand movements will be remembered in the interviews. They will guide the path.
Glad you liked it man ❤️❤️🫂
🥰🥰
Didn’t get
Bhaiiii😢😢😢😢
Bhai mat bna video , mehnat kr rha hai tu but bekar padha rha hai
bhai question hi chutiya hai , dimaag ka bhosda ho gya