6 docs tagged with "top-K"

Heaps are commonly used to implement priority queues and ensure efficient retrieval of the minimum or maximum element.

Heaps are commonly used to implement priority queues and ensure efficient retrieval of the minimum or maximum element.

Heaps are commonly used to implement priority queues and ensure efficient retrieval of the minimum or maximum element.

Find the Kth largest element in an array using a heap data structure.

Finding the Kth largest element in an array using a min heap data structure, commonly used in streaming and top-K problems.

Find the top K most frequent elements in an array using a hash map and a heap.