Onsite

Phone Screen, Googlyness, and Two Graph-Heavy Onsite Rounds

GoogleSoftware Engineer · Onsite · Sep 2026

Phone Interview Given an n x m matrix, the start is (n-1, 0) and the end is (n-1, m-1). The allowed moves are up-right, right, and down-right. Count the total number of paths to the end. Follow-up 1: There are some checkpoints in the matrix. Count the total number of paths that visit all of the checkpoints. Follow-up 2: The checkpoints must be visited in order. Given that every move changes the c…

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