Here are five rounds of algorithms questions, all of which contained a graph question.
The first question was to find job dependencies for a workflow, given its inputs. Then, they asked about circle detection and edge case checks.
The solution I provided was to use BFS, which can find parallel jobs. For circle detection, we can use a hashset to record visited nodes.
The first task was to find the workflow dependencies of jobs that input data. Then they asked whether there was any circle detection or edge case checks.
The following metrics were computed from 748 interview experiences for the Google Software Engineer role in Mountain View, California.
Google's interview process for their Software Engineer roles in Mountain View, California is very selective, failing most engineers who go through it.
Candidates reported having very good feelings for Google's Software Engineer interview process in Mountain View, California.