Acudí a una entrevista en Google (Bengaluru) en oct 2024
Entrevista
45 min 2 technical interviews, scheduled on different dates. You will be asked 1 DSA problem with an extension or 2 different DSA problems. You will have to explain your approach, and then tell the time complexities and finally code it up.
Preguntas de entrevista [1]
Pregunta 1
Graph based problem, if it would be possible to convert a graph such that each node can be connected to at max 3 other nodes, into a tree(binary tree)
Two back to back 45 min interviews. Both technical, both DSA. Mine was p easy: first was arrays and second was class design and tradeoffs. Both asked about time complexity and first one asked a lot about edge cases.
Preguntas de entrevista [1]
Pregunta 1
Make a class that supports storing ranges/combing ranges and checking if a number is captured in a range that you store.
Acudí a una entrevista en Google (Bangalore Rural)
Entrevista
It was a screening round. Google link was shared with me. They asked me some basic DSA questions but I was not prepared for DSA so I was unable to answer properly. And I got rejected in the screening round
Me postulé en línea. Acudí a una entrevista en Google (Bengaluru) en may 2026
Entrevista
The interview was very hard it consisted of Graphs and dp combined for the intern .
And also system design is also asked mostly in the google interviews.
Good luck all of you.
