The recruitment process for this position proved to be excessively lengthy and cumbersome, involving numerous stages that felt repetitive. Additionally, maintaining consistent communication with the recruiter was quite challenging, as responses were often delayed, making it difficult to stay informed about my candidacy status throughout the journey.
Interview questions [1]
Question 1
Given N numbers: a[0], a[1], ..., a[N-1]
find i <= j such that:
a[i] = a[j]
and
sum a[i] + a[i+1] + ... + a[j-1] + a[j] is maximized.
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