All problems
HardHeap

Find Median from Data Stream

amazongooglemetamicrosoftapplebloombergnetflixgoldman-sachs

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.

  • For example, for arr = [2,3,4], the median is 3.
  • For example, for arr = [2,3], the median is (2 + 3) / 2 = 2.5.

Implement the MedianFinder class:

  • MedianFinder() initializes the MedianFinder object.
  • void addNum(int num) adds the integer num from the data stream to the data structure.
  • double findMedian() returns the median of all elements so far. Answers within 10^-5 of the actual answer will be accepted.

Example 1:

Input:
["MedianFinder", "addNum", "addNum", "findMedian", "addNum", "findMedian"]
[[], [1], [2], [], [3], []]
Output: [null, null, null, 1.5, null, 2.0]
Explanation:
MedianFinder medianFinder = new MedianFinder();
medianFinder.addNum(1);    // arr = [1]
medianFinder.addNum(2);    // arr = [1, 2]
medianFinder.findMedian(); // return 1.5 (i.e., (1 + 2) / 2)
medianFinder.addNum(3);    // arr = [1, 2, 3]
medianFinder.findMedian(); // return 2.0

Examples

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, the median is (1+2)/2 = 1.5. After adding 3, the sorted list is [1,2,3] and the median is 2.0.

Example 2

Input: ["MedianFinder", "addNum", "findMedian"] [[], [5], []]

Output: [null, null, 5.0]

Explanation: With only one element, the median is that element itself: 5.0.

Example 3

Input: ["MedianFinder", "addNum", "addNum", "addNum", "addNum", "findMedian"] [[], [1], [2], [3], [4], []]

Output: [null, null, null, null, null, 2.5]

Explanation: The sorted list is [1,2,3,4]. With an even count, the median is (2+3)/2 = 2.5.

Constraints

  • --10^5 <= num <= 10^5
  • -There will be at least one element in the data structure before calling findMedian
  • -At most 5 * 10^4 calls will be made to addNum and findMedian

Optimal Complexity

Time

O(log n) per addNum, O(1) per findMedian

Space

O(n)

One problem, two ways to prep

Choose between solo practice and interview simulation

Practice Mode keeps things simple with code + tests. AI Interview Mode adds voice, pressure, and a post-round score summary.