I was contacted by recruiter. I asked him to gave me two months ow time before screen. The we scheduled my 1st interview. Google doc, phone call, headset is dvantage. Five min introduction "tell me about your PhD/project". Then, a probelm was given me to solve in very vaguous way. I clarified, proposed datastructures and custom datastructures I will use to solve the problem. I was coding, speaking aloud, my interviewr was silent. "Are you happy now with your code?", no I wasnt since I did not debugged it yet. "Are you happy now with your code?", no, let me double check... "Are you happy now with your code?", "Are you happy now with your code?", yes now I am happy, "OK". Then he asked me about complexity and If i can do better than this. The code had one bug and some redundant lines but it was fair good enough for on-site.
I applied through a recruiter. I interviewed at Google
Interview
A recruiter from Google contacted me. The initial phone screen was to see a general fit. The second round was technical. The third round would have been a full day on campus.
Interview questions [1]
Question 1
I did not expect such a simple problem and I cant believe I gave a very wrong answer which was not obvious at first.
I applied online. The process took 2 months. I interviewed at Google in Nov 2014
Interview
Good:
- Recruiter was quick (4h) to reach out to me once I applied via their website, although I did also notify my campus recruiter, so maybe that helped.
- Recruiter was great at giving me review material, answering questions, and setting up the initial interview at my pace.
Bad:
- The interviewer called late, yet ended at the agreed-upon time.
- The interviewer had poor signal, yet did not worry about moving somewhere else, which meant that he had to repeat himself many times.
- The recruiter took one month to get back to me.
Interview questions [1]
Question 1
Given two sorted lists of ordered tuples, combine them into one such that overlapping ranges are merged. For example: [ (1,4) , (10, 15) , (20, 24) ] and [ (3, 5) , (16, 17), (21, 23) ] becomes [ (1,5) , (10, 15) , (16, 17), (20, 24) ]