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.