I sat down for an afternoon of interviews after a few phone calls.

The first interviewer did not know he was interviewing me until the morning of the interviews. He took 15 minutes out of the 30 given for a technical interview, asking about my background. He was also unable to articulate his question about Hash tables.

Outside of this poor experience, the other three interviewers were very interested. They used the full 45 minutes provided to them to ask a question and then dive deeper into space/time complexity.

Sample Questions:

1. Given a pre-order traversal of a BST represented by an array of integers, generate the tree.

2. Given an infinite number of servers with an infinite amount of integers on each server, return the median integer. Assume a finite amount of space and time.