I applied online. The process took 3 weeks. I interviewed at Google (Santa Monica, CA) in Mar 2010
Interview
The whole interview process was comprised of two phone interviews, and on-site interview. The first phone interview was from an HR, and the second was a technical interview in which I was asked several basic CS problems but no algorithm development or online coding.
After that I was invited to fly to Santa Monica, CA for in-person interview. The interview insisted of 5 round of interviews. The content included algorithm, system design, and so on. I though I was doing fine, but after one week, I got a call from the HR told me that I was not accepted due to lacking of working experience. However, the overall process was smooth, the interviewers were nice and friendly. The questions are not really so hard to answer.
Interview questions [2]
Question 1
Give the descending order of the following 4 terms, assume that n is infinite. n!(n factorial), n^n, 2^n, n^(google)
I applied online. The process took 5 weeks. I interviewed at Google (New York, NY) in Jul 2010
Interview
Applied online. Contacted by recruiter, set up telco. After that, set up telco for technical interview on phone with detailed instructions on what to prepare. Technical telco went fine, invited to onsite interview. Onsite interview standard - 5 sessions with one additional for lunch. Questions mostly coding on whiteboard. Interviewers nice. Office space large and nice. Heard back after 1 week that no offer will be made.
The process took 2 weeks. I interviewed at Google (Mountain View, CA) in Jul 2010
Interview
I first did a phone interview, in which I was asked to design the file system behind their index.
Then, in my first in-person interview, I was asked various typical Interview 2.0 style questions. It seemed very focused on 'how fast can you find the clever solution to this problem'. I answered questions in c and java, mostly very basic data structure manipulations questions (implement a stack using a queue, collection of collections, etc). The most interesting question I got asked was how to do the backend for facebook.
A second call back interview was supposed to focus on design, but wound up asking me very similar data structure questions because the senior interviewers I was supposed to meet with were not available, and I got junior engineers instead.
Design an iterator for a collection of collections in java. The iterator should hide the nesting, allowing you to iterate all of the elements belonging to all of the collections as if you were working with a single collection.