I applied through college or university. The process took 1 week. I interviewed at Google (Austin, TX) in Feb 2018
Interview
They asked me two questions. The first was to, given a collection of objects, filter the permutations of the objects. The second was to write a function stating whether or not an input tree was a valid binary search tree.
Interview questions [1]
Question 1
"write a function stating whether or not an input tree was a valid binary search tree"
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