Two Heaps

Given an array of intervals where intervals[i] = [start_i, end_i] and every start_i is unique, the right interval of interval i is the interval j (possibly equal to i) whose start_j is the smallest value satisfying start_j >= end_i. Return an array of right-interval indices for each i, using -1 if no right interval exists.

The goal is to find the median of all elements in an array that are within a certain sliding window, given a set of integers and a target window size.

Design a data structure that supports adding integers from a data stream and reporting the median of all values added so far. Implement addNum(num) to ingest a number and findMedian() to return the median of every number seen up to that point.