Leetcode 295. Find Median from Data Stream

Maintain a data structure that supports adding integers from a stream and returning the current median efficiently for many interleaved addNum and findMedian calls. The core challenge is to keep the lower and upper halves balanced (e.g., two heaps) for fast updates and median retrieval, with follow-up optimizations using counting/frequency arrays when values lie in or mostly within a small fixed range.