Google | Software Engineer L5 | Seattle | Sept 25, 2020 [Offered]
Anonymous User
8672

Status: BS CS
Position: L5 Software Engineer at Google, specifically, at Google Cloud.
Location: Seattle, WA (remote until COVID situation is resolved)
Date: Sept 25th, 2020

The interview process was very standard (in my oppinion). There was a phone screen of 45 min to solve a coding problem. Then, I did an on-site (virtual cuz COVID) interview which included 3 coding, 45 min interviews, 1 behavioral interview of an hour long, and finally, 1 system design interview of around 45 min.

In more details:

  • Technical Phone Screen (45 min)

    • Algorithmic question
  • On Site

    • algorithm (45 min)
    • algorithm (45 min)
    • algorithm (45 min)
    • behavior (1 hour)
    • System Design (45 min)

After the onsite, I got a call from recruiter that they liked me, but I still had to do team match and pass the google hiring committee.

After two weeks, we did the team match were interviewed with multiple team until I found the one I liked the most (i liked them all). At the same time I got the green light from the Hiring Committee and after another week or so I got an offer.

At the time, I was also interviewing with Amazon and others, but the truth is that the interview process with Google was just perfect. Every single interview section started on time, the interviewers were extremely friendly, and the overall process was just the best.

Since this was my first time interview with Google, I was a bit afraid of the process, but it went extremely well. However, notice that I have experience in competitive programming which could be a bit of advantange in addition to 8 years of professional experience in other companies, including 2 Silicon Valley based companies.

I would link the questions, but I haven't seen any of them here in LC. However, I can say I got a binary search algorithm on the phone screen, 2 graph algorithm questions in the on-site (topological sort and shortest path (dijkstra)), and one dynamic programming question (at least my solution was dynamic).

Comments (21)