Leetcode medium, prepare lots of leetcode and get practice talking through your thought process. Several levels of questions and extensions and also talk through run time and test cases. interviewers were friendly
Questions d'entretien [1]
Question 1
given a sequence s of n digits, find a subsequence of k digits such that the number formed by these k didgits (in order) is the largest
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
J'ai postulé en ligne. J'ai passé un entretien chez Google (Sydney) en juin 2026
Entretien
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.
Questions d'entretien [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