Google New Grad VO: Directed Graph Reachability and Three Hard Coding Rounds

Role: Software Engineer, New Grad
Result: Passed the virtual onsite
Report time: May 2025

The candidate completed three coding rounds and described all of them as extremely difficult, but finished within the allotted time and felt satisfied with each dry run. Recruiting emailed the next day and scheduled a call.

Recoverable coding question

A company network contains nodes, and one node was described as corrupted. Given source and destination nodes, determine whether data can be transferred between them.

The directly recoverable core is directed-graph reachability.

Practice: Directed Graph Reachability Queries

The source does not define what the corrupted-node phrase changes. It may have been story context or an additional constraint, so the linked practice problem does not claim a corrupted-node rule.

Missing rounds

The candidate said the interviewer asked three consecutive questions and that all were completed correctly, but did not disclose the other two prompts. Comments asked about behavioral questions, OOD, and the remaining coding types, but no additional answer was posted.