DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
Back to Arena
hard
Heap

Find Median from Data Stream

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Find Median from Data Stream** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Two heaps: max-heap left + min-heap right **Edge Cases to Consider:** - (1) Single element - (2) All same elements - (3) Alternating adds

Examples

Example 1
Input: addNum(1); addNum(2); findMedian(); addNum(3); findMedian()
Output: 1.5; 2.0
Example 2
Input: addNum(1); findMedian()
Output: 1.0
Example 3
Input: addNum(1); addNum(2); findMedian()
Output: 1.5
Explanation: Even count

Constraints

  • ▪Input arguments are within valid ranges
  • ▪Optimize for execution speed
  • ▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

  • ▪Single element
  • ▪All same elements
  • ▪Alternating adds
Frequently Asked At
AmazonGoogleMicrosoftMetaAdobe