There were two back-to-back technical phone interviews. Each interview lasted about one hour.
The questions were not very difficult, but I did not answer well and I failed to solve some follow-up questions. I should have done better.
Given an n * m grid maze, each cell is guaranteed to be 0 or 1. 0 means you can walk on it and 1 means an obstacle. You start from the top-left cell. Try reaching the bottom-right cell with a shortest path.
From a cell, you can move up, down, left, or right by one step to a neighboring cell with value 0.
So, what's the length of the shortest path, and how will you find it?
LC 304 Range Sum Query 2D - Immutable
The following metrics were computed from 123 interview experiences for the Google Software Engineering role in United States.
Google's interview process for their Software Engineering roles in the United States is very selective, failing most engineers who go through it.
Candidates reported having very good feelings for Google's Software Engineering interview process in United States.