I applied online. The process took 1 day. I interviewed at Google in Dec 2009
Interview
Two 45 minute technical phone interviews back to back (45 minute gap in between). Both asked reasonable questions. Highly recommend the book Programming Interviews Exposed which the Google recruiter also recommended. At least two of the questions were almost directly taken from the book, and I would not have gotten them had I not read the book recently.
Interview questions [5]
Question 1
How do you delete a given node from a single linked list?
You have a bag of random numbers which can be negative, positive or zero, and it might contain duplicates. Describe an algorithm for finding all pairs whose sum equals some value m.
The process took 1 day. I interviewed at Google (Cambridge, MA) in Oct 2009
Interview
Two 1.5 hour long interviews. Mostly asked technical questions on simple algorithms (sorting, search, etc.). Asked to write code. Didn't ask about previous experiences at all. All in all, felt more like a school exam.
One interviewer was friendly, the other seemed bored or tired. Luck of the draw, I suppose.
Interview questions [1]
Question 1
How would you find the most searched for phrase in Google, assuming that you could use 10000 computer in parallel?
The process took 2 weeks. I interviewed at Google in Nov 2009
Interview
Had a phone interview organized by applying online. Had a phone screen, which involved writing code using Google docs. The process involved going through two interviews on the phone of forty five min each. The interviewer called, asked general stuff about what I had done before and why I wanted to join Google. Gave a brief background, mentioned the projects I had done. Talked about the courses I had taken and how they would useful at Google. Went straight into the coding from there.
Interview questions [1]
Question 1
Implement a random number generator such that the random number generated is always in a particular range. Perform through time complexity analysis of it. How would you improve the solution.