filmov
tv
LeetCode 887. Super Egg Drop | O(n * k) Worst case | O(k * log(n)) Avg Complexity
Показать описание
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
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
LeetCode 887. Super Egg Drop (Hard) | Dynamic Programming | C++
LeetCode 887. Super Egg Drop
Super Egg Drop | Leetcode #887 | dynamic programming
LeetCode 887. Super Egg Drop | O(n * k) Worst case | O(k * log(n)) Avg Complexity
Leetcode--887 super egg drop (DP)
887. Super Egg Drop | Leetcode | Egg Dropping problem | Dynamic Programming
Egg Dropping Dynamic Programming
super egg drop leetcode | Egg Drop | Leetcode 887 | Dynamic Programming
Egg Dropping Problem Dynamic Programming | Leetcode Hard Solutions
887. Super Egg Drop
43 Egg Dropping Problem Recursive
Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition
Leetcode 0887. Super Egg Drop
The Egg Dropping Problem - Interview Question
Egg dropping problem |Simple recursion with memoization| Dynamic programming | Love Babbar DSA sheet
Super Egg Drop Part 1: O(KN^2) Time Solution
Egg Dropping Puzzle with 2 Eggs and 100 Floors || Microsoft Interview Puzzles
Eggs drops and super eggs drop pure math solutions
Super Egg Drop Part 3: O(KN) Time Solution
Egg Dropping Puzzle | Problem of the Day : 01/08/22 | Yash Dwivedi
Egg dropping dynamic programming part 2
Egg Dropping Problem - Explanation
1884. Egg Drop With 2 Eggs and N Floors (Leetcode Medium)
Egg Dropping: Going beyond just solving the classic puzzle
Комментарии