Me postulé en línea. El proceso tomó 3 meses. Acudí a una entrevista en Google (Bengaluru) en abr 2024
Entrevista
It started with a brief intro of the interviewer and then she asked me for my intro then proceeding further she asked me a graph question, firstly she explained the question then asked for my approach then asked to code it.
Preguntas de entrevista [1]
Pregunta 1
Introduction, A graph question based on traversals
Acudí a una entrevista en Google (Mountain View, CA)
Entrevista
OA with three questions to solve. Each problem was a leetcode medium or hard question. I was given I think about two hours for the three questions. The site automatically locked after the given time.
The overall process was challenging but well-structured, taking a few weeks from start to finish. It began with an initial recruiter screening to discuss timeline and background. This was followed by rigorous technical interviews focusing heavily on Data Structures, Algorithms, and problem-solving (expect LeetCode Medium/Hard level questions).
After passing the technical rounds, I moved into the Team Matching phase. This involved a behavioral and technical discussion with the actual Hiring Manager to see if my past projects (C++, hardware, system architecture) aligned with the team's needs. Once the manager gave the green light, the file went to the global compensation committee. The final step before the official written offer was an automated ID verification process (via Veriff) to confirm my legal name for the contract. The recruiting team was great, but be prepared for the final administrative steps to take a bit of patience!
Preguntas de entrevista [1]
Pregunta 1
Walk me through the architecture of the most complex system you have built. What were the biggest performance bottlenecks and how did you solve them?
The first step was OA, then two 45-minute technical rounds with engineers. These rounds had one coding question + multiple follow-ups. There was some time left at the end for questions.
Preguntas de entrevista [1]
Pregunta 1
One question tested my knowledge of recursion, hashmaps, and backtracking.