Google L4 Interview Experience - US
Summary
I cleared the interviews and moved to the team-matching stage.
Full Experience
I recently completed the Google L4 interview process.
Phone Screen
Round 1 - Coding Round: Variation of Kadanes Algorithm Verdict: Strong Hire
Round 2 - Googliness Verdict: Strong Hire
Onsite Round 1 A graph-connectivity problem involving relationships that evolve over time. The solution required identifying when all entities became connected. Verdict: Hire/Lean-Hire
Onsite Round 2 A dependency-ordering problem involving parent-child relationships and deletion constraints. The solution required modeling the dependencies as a graph and determining a valid processing order. Verdict: Strong Hire
Overall, I cleared the interviews and moved to the team-matching stage.
Interview Questions (3)
Variation of Kadane's Algorithm
A coding problem that is a variation of Kadane's algorithm, requiring a modified approach to find the maximum subarray sum under specific constraints.
Dynamic Graph Connectivity Problem
A graph‑connectivity problem involving relationships that evolve over time. The task is to identify the point at which all entities become connected.
Dependency Ordering with Deletion Constraints
A dependency‑ordering problem involving parent‑child relationships and deletion constraints. The solution requires modeling the dependencies as a graph and determining a valid processing order.