Design Efficient Data Structure for Median Retrieval

Q: Design Efficient Data Structure for Median Retrieval

This question evaluates understanding of streaming data structures, median maintenance, and algorithmic complexity in the Coding & Algorithms domain by requiring efficient insertions (O(log n)) and constant-time median queries (O(1)).

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Scenario

Senior problem-solving round assessing algorithmic thinking under time pressure.

Question

Design a data structure that supports inserting integers from an endless stream and returning the median in O(log n) per insertion and O(

per query. Provide code and complexity analysis.

Hints

Two heaps approach; keep sizes balanced; median at roots.

Design Efficient Data Structure for Median Retrieval

Overview

Scenario

Question

Hints

Comments (0)