Deep dives into algorithms, system design, and problem-solving strategies for technical interviews.
Feb 6, 2026
00:00:00 Intro 00:01:28 Heap API: push & pop 00:02:40 Max-heap invariant 00:04:09 Array → complete binary tree 00:07:08 Parent / child index math 00:10:12 Push vs pop (bubble up/down) 00:11:05 Pop walkthrough (bubble-down choice) 00:13:28 Time complexity (O(log n)) 00:14:58 Coding the heap class 00:23:07 Pop + bubble-down loop 00:31:27 Testing & debugging 00:38:05 Max-heap behavior clarified 00:39:02 Heapify (O(n)) overview 00:46:10 Bottom-up heapify strategy 00:48:43 Refactor: bubble_down + heapify 00:54:09 Custom comparator requirement 00:59:01 Comparator integration 01:01:14 Comparator init bug fix 01:02:04 Edge cases (missing children) 01:02:52 Interview wrap-up #MaxHeap #Heapify #DataStructures #Python #CodingInterview
Feb 4, 2026
Feb 2, 2026
