During the technical interview process at Google, candidates can expect to encounter coding problems that primarily range from medium to hard difficulty, as categorized on platforms like LeetCode. The majority of these problems emphasize algorithmic thinking and efficient problem-solving techniques. In particular, a strong understanding of graph traversal algorithms, such as Breadth-First Search (BFS) and Depth-First Search (DFS), is crucial. These paradigms are frequently used in interview problems related to trees, graphs, backtracking, shortest path, and connectivity components.
Questions d'entretien [1]
Question 1
Given a file system structure how can you find the size of a folder given each item is either folder with id of the items inside of it, other type is file with name and size
J'ai passé un entretien chez Google (Waterloo, ON)
Entretien
HR round after applying, then coding screening round, if passes, then final round which consists of four coding round or three coding and one design round. Problem difficulty medium to hard.
J'ai postulé en ligne. J'ai passé un entretien chez Google (Zurich) en mars 2026
Entretien
Frist had one roughly 20 to 30 minutes screening call with a recruiter, then had one online 45 minutes technical interview with a Google Site Reliability Engineer. The technical interview covered data structure and algorithm topics.
J'ai postulé en ligne. J'ai passé un entretien chez Google (Dublin, Dublin) en mars 2026
Entretien
The interview lasted 45 minutes and was conducted one-on-one. I was required to walk through my thought process before coding and then implement an optimized solution with a focus on time complexity.
