The Median Keeper
A hard Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- hard
- Seniority
- L5
Interview Prompt
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.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision