Onsite

L4 Phone Screen and Three Onsite Coding Rounds

GoogleSoftware Engineer · Onsite · Aug 2026

Phone Interview Given a binary tree representing reporting relationships in a company, where each node represents an employee and its parent represents the employee's direct manager, write an algorithm to find the nearest common manager of a given set of multiple employees. This is a variant of Lowest Common Ancestor. There are K employees in the set and the tree height is H. Optimize the time co…

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