Back to posts 
Interview experience
Google · Software Engineer · Mid-Level
Community-sourced A factual summary of an interview experience shared publicly outside interviewd.
Nov 1
In Progress
Overall Experience
A phone coding interview on grid path counting with checkpoint constraints, a Googlyness round, and two onsite coding rounds on graph shortest paths and time-ordered connectivity, each with follow-ups. The record does not describe the candidate solutions or the outcome.
4 rounds
I
Posted by interviewdInterview Process (4 rounds)
Round 1 of 4: Coding / DSA
60 min
Question 1
MediumGiven an n x m grid with rows 0..n-1 and columns 0..m-1, Alice starts at (n-1, 0) and must reach (n-1, m-1). Each move advances exactly one column and can be up-right, right, or down-right; moves that leave the grid are invalid. Count the paths, modulo 1,000,000,007. Follow-up 1: count the paths that visit all given checkpoints. Follow-up 2: checkpoints must be visited in the given order; because each move enters the next column, at most one checkpoint can be visited per column, so return 0 if they cannot be visited in strictly increasing column order. Optimize space.
Input: "n m c", then c lines "r col".
Constraints: 1 <= n, m <= 2000; 0 <= c <= m - 2.
Input: "n m c", then c lines "r col".
Constraints: 1 <= n, m <= 2000; 0 <= c <= m - 2.
Experience
The record lists the base problem and both follow-ups. The candidate solution is not described.
60 min
Question 1
MediumHow would you handle a conflict if someone took credit for your work? Describe a time when your contribution was misattributed, how you addressed it while preserving the working relationship, and how you ensured contributions were accurately recorded.
Experience
The record lists the prompt. The candidate answer is not described.
Question 2
MediumHow do you manage time and coordinate daily tasks when you have multiple tasks and conflicting deadlines? Use a concrete example of managing priorities and stakeholders so that critical work was delivered on time.
Experience
The record lists the prompt. The candidate answer is not described.
60 min
Question 1
MediumGiven an undirected, unweighted graph with nodes 0..n-1, a source s, and a target t, find the shortest distance from s to t, and return every node that can lie on at least one shortest s-t path, sorted by id. If t is unreachable, output -1 and an empty node list. Follow-up: Bob is at another node; Alice follows one shortest path while Bob moves at the same time. Determine whether Alice can reach the target without being caught by Bob.
Input: "n m s t", then m lines "u v".
Constraints: 1 <= n <= 2 10^5; 0 <= m <= 3 10^5.
Input: "n m s t", then m lines "u v".
Constraints: 1 <= n <= 2 10^5; 0 <= m <= 3 10^5.
Experience
The record lists the problem and follow-ups. The candidate solution is not described.
60 min
Question 1
MediumGiven logs in the form "timestamp, userA connects to userB" for a set of users, find the earliest timestamp at which all users are mutually connected. Follow-up 1: find a timestamp after which every pair of users is within path length k and all users are connected. Follow-up 2: the log also includes deletions "timestamp, userB unfriends userC"; find the timestamp at which all users become connected. This second follow-up overrides the base assumption that connections remain active.
Input: "n l", then l lines "timestamp userA userB" in nondecreasing timestamp order.
Constraints: 1 <= n <= 2 10^5; 0 <= l <= 3 10^5; for n = 1, output 0.
LeetCode equivalentInput: "n l", then l lines "timestamp userA userB" in nondecreasing timestamp order.
Constraints: 1 <= n <= 2 10^5; 0 <= l <= 3 10^5; for n = 1, output 0.
Experience
The record lists the base problem and follow-ups. The candidate solution is not described.
Loading comments…