LeetCode 887. Super Egg Drop | O(n * k) Worst case | O(k * log(n)) Avg Complexity

preview_player
Показать описание
In this video I have explained the solution to the LeetCode 887. Super Egg Drop or InteviewBit Egg Drop Problem! or the GFG Egg Dropping Puzzle as it's called across different websites.
I could not find a satisfactory explanation to this question anywhere, so I decided to make my own :P

As is discussed in the video, with the number of eggs increasing the maximum height of the building that can be marked increases exponentially. And thus, except for the case when the number of eggs is one (worst case) the running time of the algorithm will be O(k * log(n)) on average.

Any thoughts on the video are welcome.

Timestamps:
0:00 Problem Name
0:17 Question Explanation
1:16 What constitutes a move?
2:04 Solution Foundation
6:45 Problem Modification
10:38 Solution
25:22 Code Walk-through
27:32 Embarrassing outro
Рекомендации по теме
Комментарии
Автор

pehle mujhe coding bilkul v nhi aati thi aab bhi nhi aati lekin abb coding sekhne ki curiosty jaag gyi hai iss video ko dekh kr

husandeepsingh
Автор

You are the legend bro !! Just amazing !!

HITESHKUMAR-ller
Автор

Prateek sir is god like!
Big fan sir, big fan of your work!

harshkochar
Автор

amazing video, couldn't think the solution would be this simple

shyamtayal
Автор

Your explanation was nice. It really helped me

ashwinnema
Автор

...This video is so underrated...(No Cap)

jioji
Автор

Prateek sir, I am big fan of you. Please make a video on how to do butterfly stroke?

jioji
Автор

Your question very good, it hurt my rating and broke your egg.

harshbajaj
Автор

Egg Drop but no omelette? Kya hai ye! 😂

SB-qnst
Автор

Bhai samjha raha hai ki khud samajh raha hai...

GauravSingh-lemq