Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Start Part 1 to unlock your next challenge
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.
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Desktop required to run this problem
StrongYes runs real code + tests in a desktop editor. Mobile is view-only for now, so you can’t start this here. Sorry about that — email yourself a link and pick it up on your computer.
Start Part 1 to unlock your next challenge
Desktop required
Sorry — mobile can’t run the editor + tests yet. Email yourself a link to continue on desktop.