J'ai postulé en ligne. Le processus a pris 4 semaines. J'ai passé un entretien chez Google (Austin, TX) en oct. 2014
Entretien
Applied online on August 2014. Contacted by a recruiter on early September 2014, telling me there were two technical phone screens. I chose early October to do the interviews since I required extra time to prepare for my PhD proposal defense at the end of September. The first interview went relatively smoothly. The interviewer asked basic Python questions like what list comprehension is; what the time complexity of a very algorithm. Then he asked me to write some simple modules. I think anyone who are familiar with computer science could do it in minutes. The second interviewer did not call me in time so we rescheduled for another day in the same week. The interviewer asked me a trial algorithm question in the first round; then he extend it to a general case which required candidate must have a deep understanding of recursion. I did not make it within the time limit. Overall, it's a great experience.
J'ai postulé en ligne. J'ai passé un entretien chez Google en déc. 2025
Entretien
One or two rounds of virtual interviewing including behavioral, research discussion, and technical interview. Then was flown out to one of their campuses for two in-person interviews including a technical interview and a research discussion. I was rejected after this phase but the next steps would have included meetings with team leaders for team placement.
Questions d'entretien [1]
Question 1
In-person technical interview problem involved clever usage of hashmaps and hashsets.
J'ai postulé en ligne. Le processus a pris 6 mois. J'ai passé un entretien chez Google en juin 2025
Entretien
Smooth and nice. Interviewers were listening and engaging.
The recruiter is helpful and informative.
First round: One phone interview.
Second round: Three technical interviews and one BQ interview, scheduled over two days, all remote.
Questions d'entretien [1]
Question 1
Got one question on mono-stack, one on binary search, one on binary tree traverse, and one one dynamic programing
J'ai postulé en ligne. J'ai passé un entretien chez Google en févr. 2024
Entretien
The interviewer called while I was working on a Google Doc. Initially, I was stuck. During the conversation, he provided helpful hints, and at the end, I was allowed to ask any questions.
Questions d'entretien [1]
Question 1
It was very much similar to LeetCode Random Pick with Weight