Design an alert system. You have 500,000 hotels you represent, and about 250,000 are visited each day. You want to track hotel page visits such that, if more than 10 visitors per a) 5 minutes, b) 1 hour, and c) 24 hours occur, then a (different for each time period) "alert" appears when someone visits one of those "hot" hotel pages. Don't worry about the UI part, just design the underlying alert system. Then optimize your solution for space.
Given an input stream of an indeterminate length, how do you return a random member of that stream (with equal probability for each), given that you're not allowed to store more than a constant number of inputs, and you can only go through the inputs once.
Do an in-order BST walk without additional data structures and without recursion.
nothing was difficult. He did ask me questions like "how many balls can fit in a car"..and find a root-cause problem..
Nothing was difficult. They are very helpful and will help you solve the problem.
Write a C procedure to reverse a string in-place.
Given a sorted array, find how many times a specified element appears.
Search smallest value from a tree. What if you have enough memory, how to improve the speed?
Given an array of numbers, there is one number that has a duplicate. How would you find the number?
Find if there are two members of an array that sum to 10 (10 and 0 count, but 10 alone does not).
Viewing 901 - 910 interview questions