Solicité el puesto por otro medio. El proceso duró 2 meses. Acudí a una entrevista en Google (Atlanta, GA) en oct 2018
Entrevista
I was invited to this interview after doing Google Foobar.
The first-round technical interview was relatively easy. I had to code an answer to the following simple question, which I did in Python.
Then, my interviewer asked me to do the same thing with Python iterators. I wasn't sure how they worked, so he taught me how they worked. I made an implementation that didn't quite work and we were over time, but it seemed as if he didn't expect me to code it right due to the time constraint (the interview was going over time, as it had taken some time for me to code the first problem and he had spent some time teaching me about iterators). My interviewer told me at the end that no one else had successfully that problem and that my explanation to the solution was very clear.
Then, the process was extremely slow. I'm not really sure how these interviews are evaluated, but I got a call 5 weeks later (after following up thrice) that I was rejected. Then, I got an email on how to prepare for technical interviews, and the reason I was rejected didn't seem to be very clear. Maybe the comments my interviewer had made to Google were misinterpreted in such a way that the Google admissions people had thought I had a bad interview.
And as a reference, I am in the third round of my Jane Street trading intern process, which is well-known to be way more difficult.
Preguntas de entrevista [1]
Pregunta 1
Code an algorithm to give a list to compress a string (for example, "ggghhef" would be ["g", 3, "h", 2, "e", 1, "f", 1]
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