There was an online assessment which consisted of two hard questions.The questions were not standard and required very good competitive programming skills along with dsa.The assessment was very much luck based.
Interview questions [1]
Question 1
You are given an undirected tree T consisting of N nodes rooted at node 1.You have to assign value to each node of the tree such that:1)The assigned value must be a prime number less than or equal to 100.2)The sum of values assigned to any pair of adjacent nodes is not a prime number.Determine the total number of valid assignments.
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