I applied online. The process took 3 months. I interviewed at Google in Oct 2017
Interview
Found the secret foobar link after searching technical terms on Google. Finish level 3 of the challenge, got contacted by a recruiter. Had to fill out a questionnaire about background and interests and scheduled a phone interview. First phone interview went fine even though I did end up not getting the right answer on some edge cases. After a while, got contacted by the recruiter for a second phone interview. This one was supposed to be harder and it did not go well. Got a phone call saying that I was rejected after 3 days.
Interview questions [2]
Question 1
If you have an input string and a list of pairs of commands and the length of the string that command applies to, find apply the commands in order
Given a list containing nodes of the tree in a triplet format containing the node id, its parent id, and its weight. Find the weight at each node which is the sum of the weights of all of its descendants.
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