tech-interview-handbook/contents/algorithms/heap.md

id	title
heap	Heap

Study links

• Learning to Love Heaps

Notes

If you see a top or lowest k being mentioned in the question, it is usually a signal that a heap can be used to solve the problem, such as in Top K Frequent Elements.

If you require the top k elements use a Min Heap of size k. Iterate through each element, pushing it into the heap. Whenever the heap size exceeds k, remove the minimum element, that will guarantee that you have the k largest elements.

Recommended Leetcode questions

• Merge K Sorted Lists
• Top K Frequent Elements
• Find Median from Data Stream

More questions

• Merge K sorted lists together into a single list.
• Given a stream of integers, write an efficient function that returns the median value of the integers.