Basic graph questions. Do DFS, now do recursive DFS, now do BFS on a grid, now tell me what's the runtime complexity of BFS...
It seems as if host matching is mostly based on whether the host likes you. I've had lots of experience + projects so that may have helped me more than I give credit for.
HR gave me good reference and help me to get prepared. The interview process took one hour each, and two hour in a run. The question is very fun and require knowledge to scale things up.
Interview questions [1]
Question 1
add up two numbers described by digits in two list
I applied through a recruiter. I interviewed at Google in Jan 2017
Interview
1. Coding test.
2. 2 phone calls back to back. 1 question each. First question , a variation of quick sort. Second question graph dp.
3. Had additional round. Was asked to unordered_map implementation.
Interview questions [1]
Question 1
First question , a variation of quick sort. Second question graph dp.