The process took 1 day. I interviewed at Google in Aug 2009
Interview
HR was a bit slow, and didn't get back to me with an answer until I followed up a few weeks later. Interviews were technical, very interesting, and challenging. They were computer science / software engineering problems that did not have obvious immediate answers. They want you to first state a naive algorithm, and then see if you can make it more efficient. Having a few of these interviews in a row was very draining, I definitely slowed down at the end.
Interview questions [1]
Question 1
If a person dials a sequence of numbers on the telephone, what possible words/strings can be formed from the letters associated with those numbers?
I applied through college or university. The process took 4 weeks. I interviewed at Google in Jan 2009
Interview
The entire interview process consisted of a phone interview and a day of interviews at their boston office.
The phone interview went pretty well with one main programming question. He asked me to explain how I would solve the problem and then asked me to code the answer in a google doc.
The on site interviews were pretty similar. Most consisted of on main question that I had to solve and then follow up questions on how to make it better.
In terms of the people, some were very nice and encouraging, but I also had a couple interviewers who acted like they didn't want to be there. Overall, google left me with a pretty neutral impression. Part of it might have been the ordinary boston office, but It felt like pretty much any other company.
Interview questions [1]
Question 1
How would you reverse the image on an n by n matrix where each pixel is represented by a bit?
I applied through a recruiter. The process took 1 day. I interviewed at Google (Los Angeles, CA) in Nov 2007
Interview
Recruiter contacted me and then sent me 3 exam questions to be completed in 2 hours.After 2 days she scheduled telephonic interview. Interview lasted 1 hour and 15 mins. Questions ranged from data structure design, wrting unit tests and algorithms complexity. I was asked question to find abotu tree traversal. Random quesions like why do we use desig patterns were asked.
Interview questions [1]
Question 1
Write a program to find depth of binary search tree without using recursion