👩🏫
👨💼
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Free · No sign up · Early access
1Median Finder - Basic Implementationmedium
2Part 2
Start Part 1 to unlock your next challenge
Based onLeetCode
hardGrind 75
Find Median from Data Stream
Two heaps: a max-heap for the lower half and a min-heap for the upper half, kept balanced (differ by at most 1). Median comes from comparing heap tops - O(log n) insertion, O(1) median lookup. The quintessential 'two heaps' pattern problem.
Arrays & HashingHeap / Priority QueueTwo PointersDesign
👩🏫
👨💼
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Free · No sign up · Early access
1Median Finder - Basic Implementationmedium
2Part 2
Start Part 1 to unlock your next challenge
Based onLeetCode
Get this problem sent to your inbox