I applied online. I interviewed at Google (Los Angeles, CA) in Sep 2020
Interview
Pretty straightforward questions about trees and recursion, had issues understanding both interviewers due to white noise in the call, but were very supportive during the interview process. Recommend reviewing BFS and DFS.
Interview questions [1]
Question 1
Given a binary tree and an integer n, what is the longest path such that the different of subsequent node value is n.
I applied online. I interviewed at Google (Los Angeles, CA)
Interview
First it was two coding challenges using an online editor. After that, two phone interviews of 1 hour length each. Each call consisted of one coding problem of medium difficulty
- General programming assessment (two questions)
- 2 rounds of phone interviews back to back, where I got asked one question to code on a blank doc and got asked for an extra phone interview round