← Back to Directory

Google interview notes, page 71 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·Product Manager·Onsite - Product Sense / Strategy

May 2026
Google PM interview with a classic product case question. One round, one question, but it had enough layers to keep me busy for a while.
  • Pick any product you want. Walk through its core goals, then build out what a monthly business review deck for leadership would look like.

“I picked a product I use every day thinking familiarity would help.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

May 2026
Google SWE coding round with a graph/union-find problem involving two-digit numbers grouped by shared digits. Not the hardest problem on paper but the transitive connectivity part is easy to miss if you're not thinking carefully.
  • Given an array of two-digit integers, group numbers together if they share at least one digit. The grouping is transitive, so if A shares a digit with B and B shares a digit with C, all three are in the same group. Return the size of the largest group.

“My first instinct was to just do pairwise comparisons and call it a day.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

May 2026
Google onsite coding round, one question the whole time. The problem was sum of distances in a tree and the interviewer wanted to see you walk through the brute force before jumping to the optimized solution. Pretty standard for Google but the re-root DP is one of those things you either know cold or you're fumbling through it live.
  • Given an undirected tree of N nodes, return an array where each entry is the sum of distances from that node to every other node in the tree.

“The interviewer wanted the O(n²) baseline named and sketched out first, then the O(n) two-pass version.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

May 2026
Google SWE coding round, one graph problem that looked straightforward until the follow-ups started piling up. Spent most of the time on the counting logic rather than the traversal itself, which I didn't fully anticipate.
  • Given an undirected graph and two nodes s and t, find the number of distinct shortest paths between them. Be ready to handle both unweighted and weighted edges.
  • What are the time and space complexities for the BFS-based and Dijkstra-based versions of this shortest path counting problem?
  • How does your solution handle edge cases like no path existing between s and t, or graphs with cycles?

“I got the BFS part down pretty fast, the real stumble was when they pushed toward weighted edges and Dijkstra.”

View Post

Google·Machine Learning Engineer·Onsite - Behavioral / Leadership

May 2026
Behavioral round for an MLE role at Google. Pretty standard stuff, nothing that should surprise you if you've done any prep at all.
  • Tell me about a time you had a conflict with a teammate or colleague. How did you handle it?
  • Describe a situation where you had to coach or support an underperforming team member.

“Knew this was coming and still fumbled the opening.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a data engineering role at Google and got a question on marketing channel attribution. Not much else to say, it was a single focused topic and the conversation stayed pretty narrow.
  • How would you design a system to attribute conversions across multiple marketing channels?

“This is one of those problems that sounds straightforward until you actually try to explain it.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Google coding screen for a software engineer role. One problem, fairly niche constraints, left me second-guessing my solution the whole time.
  • Given a positive integer, determine whether it qualifies as a 'Perfect Wake Number': no repeated digits, no zeros, and no digit that is strictly smaller than both of its neighbors.

“Took me a minute to even parse the constraint about adjacent digits.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

May 2026
PM interview at Google with a classic estimation question about Google Photos storage. Pretty straightforward product sense exercise but the scale of it made me second-guess my numbers the whole way through.
  • Estimate how many photos are uploaded to Google Photos annually and how much total storage that would require.

“I started with global smartphone users and tried to work down to active Google Photos users, then estimated photos per user per day.”

View Post

Google·Software Engineer·Onsite - System Design / Architecture

May 2026
Google system design round for a software engineering role. The question was a single meaty design problem that took the whole session, and I left feeling like I'd only scratched the surface of what they were actually looking for.
  • Design a mutable ordered sequence with a marker (cursor/bookmark) that points to one element. Support inserting and removing contiguous blocks at arbitrary positions, moving a block from one position to another, and repositioning the marker. Walk through your API, data model, and how the marker should behave when edits happen near or around it.

“The marker behavior is where I got tripped up.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Google SWE interview with a range query problem that looked simple on the surface but had a neat preprocessing trick behind it. Pretty clean problem once you see the pattern.
  • Given an array of integers and a set of range queries [l, r], determine for each query whether the subarray from index l to r alternates between odd and even values at every adjacent pair. Solve with O(n) preprocessing and O(1) per query.

“The brute force is obvious and they'd probably let you code it, but the real question is whether you see the prefix sum angle.”

View Post