Envié una solicitud electrónica. El proceso duró 3 semanas. Acudí a una entrevista en Google en sept 2018
Entrevista
The first round was a coding round which was pretty much like any other coding round. Easy to medium difficulty level questions. Next round was two technical phone interviews. Interviewers are friendly and there is nothing to worry about. Just hope that you don't a Chinese guy with a strong accent. It's difficult to communicate effectively. Questions posted below.
Preguntas de entrevista [2]
Pregunta 1
Sum of leaf nodes of a binary tree without using recursion or stack space. (Constant space solution)
there is no online assessment, very simple phone call, then two technicals. technicals are not difficult by any means. then you get put into team matching, after a couple months
Envié una solicitud electrónica. Acudí a una entrevista en Google (Sídney) en jun 2026
Entrevista
Resume screening and then two 2 rounds of technical interviews, on an elimination basis. Interview done on google docs with no IDE, dsa leetcode style question. May be asked follow up questions on how to optimise your solution or on how you would code up a solution to a similar problem.
Preguntas de entrevista [1]
Pregunta 1
DSA tree question, medium-hard leetcode difficulty.
Home exam, 2 questions in 90 mins
Then they did 2 interviews-45 mins each
It was on google meet
The interviews are in English, the first question was matrix dfs and the second one was hashmap with random function