Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1Median Finder - Basic Implementationmedium

2Part 2

Start Part 1 to unlock your next challenge

Based onLeetCode

Want to keep going?

$79 once — Own Words Pack. Hosted voice. We pay the model bill.

See pricing

hardBlind 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

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

Start coached rep

Start a coached rep now. Guest text is free. Sign in if you want this work on another device.

Email me this coached-rep link

1Median Finder - Basic Implementationmedium

2Part 2

Start Part 1 to unlock your next challenge

Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.