Interview preparation course


Heaps are commonly known as priority queues and mostly used in ranking problems. In this lesson, we will learn how to solve a few of the most commonly asked problems in an interview using a priority queue.

Problems set

  1. Fundamentals of the heap and priority queue
  2. Sliding window maximum
  3. Find Kth smallest element
  4. K top most frequent words/elements/chars
  5. Find Kth smallest in a matrix
  6. Merge sorted lists
  7. K smallest pairs
  8. Find the median in a data stream
  9. Kth largest in a stream
  10. Kth closest point to the origin.

Leave a Reply

Your email address will not be published. Required fields are marked *