I applied online. I interviewed at Google (París) in Oct 2024
Interview
The interview was 45 minutes in total. at the beginning there was a bit introductory and small talk what his role, mine etc roughly 5-7 minutes.
Then we moved to the technical question, we first went over the question, asked a few clarifying examples etc, 35 minutes to solve it and the last few minutes to over it, conclusion and goodbye.
Interview questions [1]
Question 1
Given a set of routers (A, F) each can spread wifi to a specific set of routers, find if turning on router A can cover Router F
I applied online. I interviewed at Google (New York, NY)
Interview
3 rounds: 1st - Online Assessment, 2nd, online - 2 interviews (1 behavioral and 1 dsa), 3rd onsite - 2 interviews (both dsa). i was expected to go from brute force to optimal soln and explain tradeoffs, edge cases and time-space complexity
Interview questions [1]
Question 1
they asked me modified binary search, variation of djikstras' and time based queue questions
I applied through an employee referral. I interviewed at Google (Sídney) in Jan 2026
Interview
Technical round 1, was asked a simple array question, then how to optimise it, code in python, what is a generator, how to use yield to flatten the iterator of an array. Follow up was a deep nested array, how to flatten it, I use DFS, then interviewer ask how to use yield, and generator to solve this question
Interview questions [1]
Question 1
Technical round 1, was asked a simple array question, then how to optimise it, code in python, what is a generator, how to use yield to flatten the iterator of an array. Follow up was a deep nested array, how to flatten it, I use DFS, then interviewer ask how to use yield, and generator to solve this question
foi um processo detalhado e criterioso, os entrevistadores foram super gentis e atenciosos, o nivel da questao foi de medio pra cima, exigiu muitos conhecimentos mais sofisticados de dsa como grafos.
Interview questions [1]
Question 1
citar um desafio importante enfrentado na carreira.
