Find Median from Data Stream

Solution Approach

Was this helpful?

Hard•data-structure•Expected: O(log n) time, O(n) space

heap

Problem

Design a data structure that supports adding integers from a stream and finding the median of all elements.

Example 1:

Input: ["MedianFinder", "addNum", "addNum", "findMedian", "addNum", "findMedian"]
       [[], [1], [2], [], [3], []]
Output: [null, null, null, 1.5, null, 2.0]
Explanation: After adding 1 and 2, median is (1+2)/2 = 1.5.
             After adding 3, median is 2.0.

Reference solution unlocks after your first submission

Language: