Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition
40:18
Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.
27:05
Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)
23:12
The Change Making Problem - Fewest Coins To Make Change Dynamic Programming
20:30
The 0/1 Knapsack Problem (Demystifying Dynamic Programming)
25:31
Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems
22:23
Egg Dropping: Going beyond just solving the classic puzzle
19:38
Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)
13:48