Search lands in PR-5.1 (Pagefind).

Data Structures & Algorithms

Frequency-based

Heap ordered by counts — top-K elements by frequency or reorderings that respect frequency caps.

  1. Problem 01 Top K Frequent Elements Counter + min-heap of size K on frequency; evict the low-frequency root. 6 min
  2. Problem 02 Frequency Sort Counter + max-heap; pop most-frequent, emit `cnt` copies, repeat. 5 min