Minimize Maximum of Array || Binary Search || Arrays || C++/Java/Python

preview_player
Показать описание
In this video, I'll talk about how to solve 2439. Minimize Maximum of Array - We go from Brute Force to Better to Optimal Solution.

Minimize Maximum of Array || Binary Search || Arrays || C++/Java/Python

Let's Connect:

Resources you can try:

🎥Channel Playlists

About Channel:
We teach about how you can grow in life & educate about programming in Fun & Intuitional way.

About Me:
I am Aryan Mittal - a Software Engineer, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 - Problem Explanation
2:49 - Going through the Example
4:52 - Brute Force Solution
6:35 - Better Solution
18:32 - Optimal Solution

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Рекомендации по теме
Комментарии
Автор

Solving problems at 6 am with a full time job, really putting in the hard work. Appreciate you, man

abhishekmahajan
Автор

Best explanation on the planet for this question! Right from starting to build the intuition to land upon the optimal solution, everything was perfect.

Gnaneshh
Автор


And guys do share you thoughts on which approach 2 or 3, you found more Intuitional & which one was more Easy to get to 😎 !!

ARYANMITTAL
Автор

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.

satyamgupta
Автор

wow! Never thought binary search can be used here, increasing any previous element for ith element was lit!!

mdshaqlain
Автор

thanks . Clicking such approach requires a lot of hard work. The way you present this answer is itself very interesting. One of best explanations.

LokeshSharma-hmjz
Автор

Wo! Your Explaining skills are Brilliant

bahnimanghosh
Автор

Amazing! Detailed and concise explanation, proves the insight step by step with maths. This is the essence of Computer Science.

fighterdse
Автор

Thank you aryan for picking new question it helps a lot

ashishdhal
Автор

That was amazinggg!! Keep boing bro <3

riddhibandyopadhyay
Автор

I was confused beacuse of that ceil function....ceil(a / n) = a + n - 1 / n....is such a good method....thanks for explaining it😁

rajatsharma
Автор

bhai brute force how will we know when to stop

kanishparihar
Автор

i've been solving this problem for hours. Good solution man !

leeris
Автор

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

cholocatelabs
Автор

Such a cool mathematical explanation. Thanks Man!!

hymnish_you
Автор

Man you are awesome!! Keep up the good work.

rudrikasingh
Автор

what are you using for i mean which pen tab..??

VinaySingh-jfde
Автор

Thanks bro was able to understand the explanation.... Are u releasing leetcode problems everyday

Voyager
Автор

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.

jakartaxx-rqkv
Автор

so this was uploaded just recently !!! I was thinking why wasn't the video showing up in searches

ruin