← Back to Directory

Google interview notes, page 130 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

Jun 2026
Got a product strategy case at what seemed to be a PM interview round. The question was framed around Lyft's driver payment model, which felt like a curveball coming from a health-tech company context. Took me a bit to figure out what angle they actually wanted.
  • You're a PM at Clipboard Health. How would you redesign Lyft's driver payment structure to maximize net revenue over a 12-month horizon?

“The cross-company framing threw me off more than it should have.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Google PM interview with a product design question about building an app for an amusement park. Pretty open-ended, which sounds fun until you're actually in it.
  • Design a mobile app for an amusement park. Walk through your approach.

“I jumped straight to features, which was a mistake.”

View Post

Google·Technical Program Manager·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round at Google for a TPM role. Just one question but it took the whole session to unpack.
  • Tell me about a time you had to manage a project where critical information was missing.

“I had a story ready but it was too clean.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Google SWE coding round, got a list manipulation problem that looked deceptively simple but had some tricky edge cases around impossibility conditions. Not much else to say about the context, no outcome info shared.
  • Given two integer arrays and a value k, delete the minimum number of elements from the second array (preserving order) so that the first k elements of each array share no common values. Return -1 if it's impossible.

“My first instinct was greedy: collect the values in list1's first k elements into a set, then scan list2 and count how many elements you need to skip before you've accumulated k non-conflicting ones.”

View Post

Google·Software Engineer·Technical Phone Screen

Jun 2026
Google SWE coding round, one algorithmic problem the whole time. The question was a movie recommendation system and the performance constraints made it more interesting than it sounds.
  • Given a list of movies with ratings and genres, and a user's preferred genres, return the top K movie IDs by rating. Dataset can be up to 10^6 entries, so optimize accordingly.

“My first instinct was just sort and slice, which works but they pushed back on performance immediately.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Google SWE interview with a grid layout problem that started familiar and then got weird fast. The shape twist caught me off guard more than I expected for what looked like a coding round.
  • Given an irregular garden shape formed by two squares of different sizes stacked vertically and left-aligned (total area N² + M²), and a list of crop types with prescribed cell counts summing to the total area, generate a planting layout where each crop type occupies exactly its prescribed number of cells and forms a single 4-connected region.
  • How does the irregular two-square shape change your traversal strategy compared to a standard rectangular garden, particularly at the seam where the two squares meet?
  • Are all input multisets of crop counts feasible for this shape, or are there configurations that cannot be planted while keeping each crop as a single 4-connected region?

“My first instinct was to just run a boustrophedon traversal like you would on a plain rectangle, assign crops in order, done.”

View Post

Google·Software Engineer·Technical Phone Screen

Jun 2026
Went through a phone screen and first DSA round for a Google SWE role. Phone screen felt solid overall, but the DSA round fell apart on the follow-up when I proposed Union-Find and then completely froze trying to explain it. Still have more rounds coming up and genuinely not sure where I stand.
  • Given an algorithm problem, identify and explain the time complexity of your solution, including all contributing steps.
  • After solving the initial problem, how would you modify your approach given an additional constraint?
  • You modified the grid in place during your DFS solution instead of using a separate visited set. What are the potential issues with that approach?
  • Walk through how a Union-Find solution would work for this problem, and implement it.

“Quoted the complexity without accounting for the sorting step, which the interviewer had to nudge me on.”

View Post

Google·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round at Google for a software engineer role, just one question but it took up the whole conversation. More layered than I expected.
  • Tell me about a time you introduced something new to your team, like a tool, process, or technical practice. How did you get people on board, drive actual adoption, and figure out whether it worked?

“I had a solid story ready but fumbled the 'measure success' part.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Got a Google SWE coding round with a house robber style DP problem. Pretty classic but the follow-ups on space optimization and path reconstruction kept things interesting.
  • Given an array of scores, select a subset of indices such that no two chosen indices are adjacent, and return the maximum total score possible.
  • What is the time and space complexity of your solution, and can you reduce the space usage without affecting time complexity?
  • Modify your solution to also return one valid set of chosen indices that achieves the maximum score, not just the score itself.

“Standard DP setup, dp[i] = max(dp[i-1], dp[i-2] + nums[i]).”

View Post

Google·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Google EM interview with a system design question about monitoring infrastructure at scale. Pretty open-ended, which I wasn't fully prepared for.
  • How would you design a monitoring system for 1000 web servers?

“I started talking about metrics collection and aggregation pipelines but realized mid-sentence I hadn't asked anything about what we're actually monitoring for.”

View Post