Search lands in PR-5.1 (Pagefind).

Data Structures & Algorithms

Two Heaps — Order Statistics

Balance a max-heap (low half) and a min-heap (high half) around the running median.

  1. Problem 01 Find Median from Data Stream Max-heap for the lower half, min-heap for the upper; the medians are at both roots. 8 min
  2. Problem 02 Sliding Window Median Two heaps + lazy-delete map; virtual size counter keeps balance. 9 min