I applied through an employee referral.
I was then contacted by HR to schedule two back-to-back phone interviews. This process took two weeks.
The interviewers were quite nice. They asked few questions about my resume and other aspects. Most of the time, I was required to complete algorithm questions.
Here, I will present the hardest question from the interview.
Given a binary tree, find if there are two subtrees that are the same. This means the tree structures are the same, and the values on all corresponding nodes are the same. You should find the largest subtrees.
(And no, don't use brute force.)
The following metrics were computed from 5 interview experiences for the Google Software Engineering role in San Francisco, California.
Google's interview process for their Software Engineering roles in San Francisco, California is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Google's Software Engineering interview process in San Francisco, California.