Google | Software Engineer L5 | Seattle | Sept 25, 2020 [Offered]
- Result
- Offer
- Location
- Seattle, WA
- Experience
- 8 years
- Posted
- 28 Oct 2020
Summary
I successfully interviewed for an L5 Software Engineer position at Google Cloud in Seattle, WA. The process involved a phone screen, a virtual onsite with three coding rounds, a behavioral interview, and a system design interview, culminating in an offer after team matching.
How it went
I underwent a standard interview process for an L5 Software Engineer role at Google Cloud in Seattle, WA. The process, conducted virtually due to COVID, began with a 45-minute phone screen focused on a coding problem. Following this, I proceeded to a full virtual onsite, which comprised three 45-minute algorithmic interviews, a 1-hour behavioral interview, and a 45-minute system design interview.
After the onsite, my recruiter informed me that I was well-received, but still needed to clear team matching and the Google Hiring Committee. Over the next two weeks, I participated in several team match interviews, finding many teams appealing. Simultaneously, I received approval from the Hiring Committee, and an offer followed about a week later.
At the time, I was also interviewing with other companies like Amazon, but I found Google's interview process to be exceptionally well-organized and positive. Every segment started promptly, interviewers were consistently friendly, and the overall experience was excellent. Despite this being my first time interviewing with Google, it went remarkably smoothly. I believe my competitive programming background, combined with 8 years of professional experience, including time at two Silicon Valley companies, gave me a considerable advantage.
Questions asked (4)
- 01
Binary Search Algorithm
Data Structures & Algorithms
A coding problem requiring the implementation or application of a binary search algorithm.
- 02
Topological Sort
Data Structures & Algorithms
A graph problem requiring the application of a topological sort algorithm.
- 03
Shortest Path (Dijkstra's Algorithm)
Data Structures & Algorithms
A graph problem requiring the application of Dijkstra's algorithm to find the shortest path.
- 04
Dynamic Programming Problem
Data Structures & Algorithms
A problem that could be solved using dynamic programming techniques, as the candidate's solution for it was dynamic.
How they prepared
My preparation largely leveraged my background in competitive programming, which I found to be a significant advantage. Additionally, my 8 years of professional experience, particularly at two Silicon Valley-based companies, contributed to my readiness.