← Back to Directory

Google interview notes, page 112 of 215

FAANG / Big Tech

Most of these Google write-ups come from Software Engineers (1,167), then Product Managers (686) and Data Scientists (125). The most reported rounds are the product sense round (667), the technical phone screen (660), the behavioral / leadership round (252) and the onsite coding round (214).

2146 interview notes · updated Oct 2026

Google·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Google data engineer interview focused almost entirely on one big behavioral/technical hybrid question about building a stakeholder dashboard. Four parts to it, each going deeper than the last. Felt more like a case study than a standard behavioral round.
  • Walk me through a dashboard you built for business or product stakeholders. What was the goal, who was the audience, and what metrics did you track?
  • How did you make sure the dashboard data was accurate and actually useful to the people reading it?
  • Describe a time your dashboard surfaced a real problem. How did you investigate the root cause and what did you actually do about it?
  • How did stakeholder feedback change the dashboard over time, and how did you know it was actually making decisions better?
  • Which metric definition caused the most disagreement, and how did you resolve it?
  • What tool did you use for the dashboard and why that one over alternatives?

“This is where I started strong and then kind of lost the thread.”

View Post

Google·Technical Program Manager·Onsite - Multi Round

May 2026
Interviewed for a TPM role at Google and got hit with a process-heavy question about Agile that I thought I was prepared for but definitely wasn't as prepared as I thought.
  • What are the problems or limitations of Agile as a methodology?

“I went straight into the obvious stuff, velocity gaming, standups becoming theater, that kind of thing.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Three coding questions at Google for a software engineer role. Stack-based string decoding, a dynamic programming jump problem with a tricky follow-up about negatives, and the classic island counting grid question. Pretty standard algorithmic fare but the follow-up on question two had some real teeth.
  • Given an encoded string like '3[a2[c]]', decode it by expanding each k[string] pattern, where k is a positive integer and patterns can be nested.
  • You start at index 0 of an integer array. At each index you can either take the value as profit and jump forward by that amount plus one, or skip it and move one step. What's the maximum total profit? Follow-up: how does your approach change if the array can have negative values, which could cause backward jumps?
  • Given a grid of '1's and '0's, count the number of distinct connected land regions, where two land cells are connected if they share a horizontal or vertical edge.

“Went with a stack pretty quickly, push counts and partial strings as you scan through.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

May 2026
Google SWE coding round, one graph problem that looked familiar but had a small twist on the edge weights that nearly tripped me up.
  • You have n nodes labeled 1 through n and a list of directed edges, each with a travel time. Given a starting node, find the minimum time for a signal to reach every node. Return -1 if some nodes are unreachable.

“Recognized it as a shortest path problem pretty fast, went with Dijkstra.”

View Post

Google·Machine Learning Engineer·Technical Phone Screen

May 2026
Interviewed for an ML engineer role at Google, got a string manipulation problem that felt more like a warm-up than a real technical challenge. Pretty short session from what I remember.
  • Given two strings A and B, how would you count the number of times characters from B appear in A?

“Seemed straightforward so I jumped straight to a frequency map approach.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

May 2026
Google PM interview with a single product design question focused on accessibility and underserved user segments. Pretty open-ended, which sounds fun until you're actually sitting there trying to figure out where to start.
  • Design a Google product specifically for elderly users.

“I went straight into listing features for existing Google products and had to course-correct mid-answer when I realized I wasn't actually scoping the user well.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

May 2026
Google SWE coding round, basically a heap problem disguised as a follow-up. The core algorithm wasn't too bad once I remembered the pattern, but the complexity analysis and duplicate handling tripped me up more than I expected.
  • Given an integer array and an integer K, return the K largest pairwise sums (where the two indices must be different). Aim for an efficient solution better than brute force.
  • Walk through the time complexity of your solution and justify the K log N bound.
  • How would you handle duplicate values in the output, and does your current approach produce them correctly?

“I knew sorting descending was the right first move, and I'd seen the two-sum variant before so I wasn't starting from zero.”

View Post

Google·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Interviewed for a product designer role at Google, and it was pretty much what you'd expect from a behavioral round. One question, standard conflict scenario, nothing wild.
  • Describe a time you had to navigate a conflict within a team.

“I had a story ready but rambled a bit trying to set up too much context.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Google SWE coding round with a chunking problem that sounds deceptively simple but has a few edge cases that'll trip you up if you're not careful. Not the hardest problem I've seen from them but the constraints kept me honest.
  • Given a fixed-size unsplittable header and a variable-length data payload, split everything into chunks where no chunk exceeds a maximum size and the header is never split across chunks. Return an optimal split that minimizes the number of chunks.

“The greedy approach is pretty natural once you accept that the header has to stay whole.”

View Post

Google·Software Engineer·Onsite - System Design / Architecture

May 2026
Google SWE interview with a meaty system design / data structures problem about modeling an org hierarchy. Not your typical LeetCode grind, this one required actual thinking about correctness guarantees and edge cases under weird input orderings.
  • Design a data structure that supports three operations on an org hierarchy: recording that one employee directly manages another, recording that two employees share the same manager (even if that manager is unknown yet), and querying whether one employee is an ancestor of another in the management chain. Handle out-of-order operations, reconcile implied relationships, and reject cycles.

“This one took me a while to even parse correctly.”

View Post