First interview: 1. Improve the product google glass by identifying objects in scene and populating information about it on screen. 2. How to efficiently index a book based on words Second Interview: 1. SQL - write a query to extract the first occurrences of sales according to person name (I am not very experienced in SQL and my answer might not have been very good. But he realized that about my background and moved on to programming questions). 2. Write a function to find the 2nd highest number in an array - Easy to solve. 3. Write a function to find the nth highest number - I kept giving solutions and he asked me to improve the time complexity at each step. First step - use quick sort to find nth order statistic Second step - to sort the function by merge sort and return nth order statistic. Third step - if this function is called over and over again, use a hash table to store sorted version of array and return the nth statistic. 4. How to efficiently index a book based on words 5. Probability question: There's one box - has 12 black and 12 red cards, 2nd box has 24 black and 24 red; if you want to draw 2 cards at random from one of the 2 boxes, which box has the higher probability of getting the same color? He added, can you tell intuitively why the 2nd box has a higher probability - My solution was that at a step when you remove a card, say a red one, the second box still has a higher probability of drawing a red card than the first box and he said it is right.
