Google L4 Interview Experience - US

Location
US
Posted
14 Jul 2026
96 reads

Summary

I cleared the interviews and moved to the team-matching stage.

How it went

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.

Questions asked (3)

  1. 01

    Variation of Kadane's Algorithm

    Data Structures & Algorithms

    A coding problem that is a variation of Kadane's algorithm, requiring a modified approach to find the maximum subarray sum under specific constraints.

  2. 02

    Dynamic Graph Connectivity Problem

    Data Structures & Algorithms

    A graph‑connectivity problem involving relationships that evolve over time. The task is to identify the point at which all entities become connected.

  3. 03

    Dependency Ordering with Deletion Constraints

    Data Structures & Algorithms

    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.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!