The Median Keeper

A hard Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

hard

Seniority

L5

Problem

Given a stream of integers, return a list of the running medians (average of two middles for even count). Use two heaps (max-heap + min-heap) for O(log n) insertion.

Summary

The middle value keeps moving as new data arrives.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.