← Heaps and Priority QueuesDSA 3.3.A

Top-K

Maintain a heap of size k to track the k largest, smallest, or closest elements.

StatusPending

Notes from readers

Comments — via GitHub