In progressOnsite

Two Onsite Coding Rounds and Communication Friction

GoogleSoftware Engineer · Onsite · Sep 2026

r1 Given a connections array, where connections[x] is a list representing the neighboring nodes of x in a graph, and a broken value representing a damaged node, return the minimum number of nodes that must be traversed from start to destination without passing through broken. The solution could use DFS or BFS. I used DFS. The follow-up allowed traversal through broken nodes. r2 Implement a word p…

Shared by a candidate · reported Sep 2026. Interview formats change; use it as a guide, not a script.