given an integer input stream, and more and more integers are still going in. build an algorithm to return 3 minimum integers at any point of time.
Anonymous
As far as I can see, if the integers are never removed, just keep the array of the 3 minimum ints and for each input adjust appropriately. The min will never go back up if nothing is ever removed.
Check out your Company Bowl for anonymous work chats.