PriorityQueue | Learn for Master
  • Find median of a infinite stream of integers

    Median of a stream of numbers

    Given a stream of integers, find the median of the stream of numbers received so far. 

    Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.

    Median of stream of numbers can be queried at multiple times at different point of time. Insertion and median functions can be called in any order. For example:

    First solution be to store the stream received in an unsorted array.

    [Read More...]
  • Java PriorityQueue Example

    Queue is an important data structure that offers first-in, first-out service. However, some items or tasks put in the queue may be more important than others (higher priority), and we want the items with highest priority to be served first.  We need a data structure to put the item or task with highest oder at the head of the queue. Such a data structure is called PriorityQueue.  Heaps are usually used as the underlying data structures of priority queues. 

    There are basically two operations for a priority queue: remove the maximum (or minimum) and insert new items to the queue.  

    [Read More...]