I was contacted by a university recruiter around mid-August 2016, and we scheduled a brief introductory call. The call was informal, and I decided to move forward with the process. She then emailed me a candidate survey (I can't remember exactly what was asked) and a coding sample to be completed within seven days.

I finished the coding sample sometime that week, and the recruiter contacted me shortly after to schedule a phone screen interview with an engineer. I opted to schedule the phone interview four weeks after the recruiter call, so my interview was not until mid-September.

The interviewer for my phone screen was probably the nicest person I have ever talked to. (I can tell you from my previous Google interviews, this is not always the case.) He asked one question based around detecting palindromes on any pair of words in a dictionary. The interview was on a Wednesday, and the recruiter told me she would give me feedback the following week. I informed her the next day that I had a competing offer with the deadline approaching, and about two hours after she told me I was moving forward to on-site interviews.

They flew me out to Mountain View the next Friday for a set of interviews. I arrived at the office at around 9:30 AM (the Google Maps building; it was pretty cool), and my first interviewer met me shortly after. I had a series of four 45-minute interviews, separated by lunch after the first two. The on-site interviews were not as challenging as the phone screen, but I think this just depends on who the interviewers are and what type of questions they ask or you are prepared for.

I heard about two weeks later that I passed the main hiring committee and then, one week later, I had the official offer letter.

Signed an NDA, but some topics that were covered in my interviews:

• Binary Search (This came up multiple times during the process)
• Trees (basic binary tree and tries, tree traversal, NOT Red Black, etc.)
• Discrete Math (subsequences and permutations)
• Probability & Testing (Yes, together - random distributions, modeling, error/bug detection)
• Hash Tables (Also came up multiple times)
• Sorting (implementation and complexity)