Three Phone Interviews taken over a period of 2 months. The first two interviews took place back to back. First one was okay and focused on changing variable names from camel case to snake case and vice versa. The second involved removing a node and restructuring an ordered binary tree and went much better than the first one. Because I got fairly positive feedback, the third one was used to gauge whether I should go to hiring committee and was a graph search problem. It did not go well.
Interview questions [1]
Question 1
Transforming camel case to snake case for variables names
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
I applied online. I interviewed at Google (Sydney) in Jun 2026
Interview
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.
Interview questions [1]
Question 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