CareerCup

Here is the code I wrote to get the same done with a Priority Queue for the part 1.

For part 3 it is simple, you poll() 10 elements when you reach the time out.

I am not sure about part 2. What are your ideas?

package ds.heaps;


import java.util.Comparator;
import java.util.Date;
import java.util.PriorityQueue;


class MinMaxPrinter {

    static PriorityQueue<Integer> minHeap = new PriorityQueue<>(); // max heap

    static Comparator<Integer> c = new Comparator<Integer>() {
        public int compare(Integer a , Integer b) {
            return b - a;
        }
    };

    static PriorityQueue<Integer> maxHeap = new PriorityQueue<>(c);

    public static void main(String[] args) {

        Runnable r1 = new Runnable() {

            public void run() {

                java.util.Random random = new java.util.Random();

                while(true) {
                    int r = random.nextInt(1000000);
                    minHeap.add(r);
                    maxHeap.add(r);
                    sleep(100);
                }

            }
        };

        Thread t1  = new Thread(r1);
        t1.start();

        Runnable r2 = new Runnable() {

            public void run() {
                while(true) {
                    sleep(30000);
                    System.out.println("Printing min max at " + new Date(System.currentTimeMillis()).toString());
                    System.out.println(" min size " + minHeap.size());
                    System.out.println(" max size " + maxHeap.size());
                    System.out.println("Min " + minHeap.poll());
                    System.out.println("Max " + maxHeap.poll());
                }
            }
        };

        Thread t2  = new Thread(r2);
        t2.start();
    }

    private static void sleep(int t) {
        try{
            Thread.sleep(t);
        } catch(InterruptedException e) {
            e.printStackTrace();
        }
    }

}