← Back to Directory

Google interview notes, page 187 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 - Coding / Algorithms

Jun 2026
Google SWE coding round, one question but it had real depth to it. Basically a mashup of two problems I'd seen before, which made me overconfident at first.
  • Design a time-based key-value store that supports set(key, value, timestamp) and getClosest(key, timestamp), where getClosest returns the value whose stored timestamp is nearest to the query (not just the floor). Walk through a baseline solution and discuss how you'd improve it.

“I recognized the two problems it was pulling from pretty fast and jumped straight to the sorted list plus binary search approach.”

View Post

Google·Software Engineer·Technical Phone Screen

Jun 2026
Phone screen for a Google SWE role, AI infra track. Two-part coding problem centered on compressed vector storage and dot product computation. Pretty focused session, no behavioral stuff at all.
  • Design a compact storage format for a long integer vector that contains many repeated values. Walk through the tradeoffs between different representations.
  • Given two vectors of equal logical length, each stored in your compressed format, compute their dot product efficiently.

“I went straight to run-length encoding (value, count pairs) which felt right for the example they gave.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Google onsite coding round, second interview of the day. The problem was a grid pathfinding variant where you minimize the maximum cell value on a path rather than the sum, with a follow-up that pushed into general weighted graphs. Harder than it looks if you haven't thought carefully about why Dijkstra even works when the cost function isn't additive.
  • Given a grid of integer heights, find a path from the top-left to the bottom-right corner such that the maximum cell value along the path is minimized. You can move to any of the four adjacent cells.
  • Follow-up: given a directed weighted graph and a source node, return the maximum shortest-path distance across all nodes, or -1 if any node is unreachable.
  • Why does Dijkstra's algorithm remain correct when the path cost is defined as the maximum edge or node value encountered, rather than the sum of weights?

“I knew this was Dijkstra-flavored but fumbled the transition from 'minimize sum' to 'minimize max' for a bit.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Google PM interview with a single product design question set in a very specific context. The Heathrow ATM prompt sounds deceptively simple but there's a lot going on once you start pulling threads.
  • Design an ATM specifically for Heathrow Airport in London.

“I spent the first minute just thinking about who actually uses an ATM at an international airport and that turned out to be the right move.”

View Post

Google·Product Manager·Hiring Manager Screen

Jun 2026
Interviewed for a PM role at Google, just the one question about goal-setting for teams. Short but it made me think harder than I expected.
  • How would you set goals for your teams?

“I went straight into OKRs and top-down alignment, which felt fine in the moment but looking back I skipped over the part about how you actually get buy-in from the team itself.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Google SWE coding round, one problem the whole time: validate whether a parent array forms a valid rooted tree. Felt manageable but there are more edge cases than you'd think at first glance.
  • Given an array where each index represents a node and each value represents that node's parent (with -1 indicating the root), determine whether the structure forms a valid rooted tree.

“My first instinct was union-find and I went with it, but I almost forgot to validate that parent values themselves are in range before doing anything else.”

View Post

Google·Product Manager·Onsite - Behavioral / Leadership

Jun 2026
Interviewed for a PM role at Google, one round, behavioral focus. Pretty standard stuff but the problem-solving question took more thought than I expected.
  • Tell me about a time you tackled a complex problem. Walk me through how you approached it.

“I had a story ready but halfway through I realized it wasn't actually that complex, more like a coordination mess than a real problem.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Passed the phone screen for a Software Engineer role at Google and now prepping for two in-person DSA rounds in Warsaw. Main question is whether the prep strategy needs to change and how deep to go on more obscure data structures.
  • For Google onsite DSA rounds, should you study advanced data structures like Fenwick trees and segment trees, or is covering the core 150 Leetcode problems sufficient?

“This is basically what I'm losing sleep over.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Google PM interview with a product sense question about AirPods Pro, which was a bit of a curveball since it's an Apple product. The follow-up on data and prioritization is where it got interesting.
  • How would you improve AirPods Pro?
  • What actionable data would Apple realistically have to measure the severity of those pain points, and how would that data inform your prioritization decisions?

“Slightly weird to get a competitor product question at Google but I've heard it happens.”

View Post

Google·Software Engineer·Hiring Manager Screen

Jun 2026
Interviewed for a BA role at Google, one question about handling ambiguous stakeholder asks. Not much else to report.
  • How do you handle a request from a stakeholder that isn't clearly defined?

“This is the kind of question where you think you have a good answer until you're actually saying it out loud.”

View Post