{"blocks": [{"key": "6f129a97", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "52271d0b", "text": "Senior problem-solving round assessing algorithmic thinking under time pressure.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "d0cc741a", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "de0b66be", "text": "Design a data structure that supports inserting integers from an endless stream and returning the median in O(log n) per insertion and O(1) per query. Provide code and complexity analysis.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "d57a78e4", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "b620cc3d", "text": "Two heaps approach; keep sizes balanced; median at roots.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}