← Back to Directory

Google interview notes, page 23 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 - Product Sense / Strategy

Apr 2026
Interviewed at Google for what seemed like a hardware product role. One question, kind of a weird one, and I'm still not totally sure what the right answer was supposed to be.
  • How would you integrate Amazon Alexa hardware into a car if there were no software integration available?

“This tripped me up because my brain kept wanting to go to software solutions.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

Apr 2026
Google PM interview with a classic product analytics scenario. Nothing flashy, just one meaty metrics question that took more thinking than I expected.
  • YouTube comments are up but watch time is down. What do you do?

“My first instinct was to celebrate the comments and explain away the watch time drop, which in hindsight was exactly the wrong direction.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

Apr 2026
Google PM interview with a hardware product design question. Single question, pretty open-ended, felt like they wanted to see how you scoped a niche use case rather than just brainstorm features.
  • How would you design a Google Pixel Tablet tailored specifically for restaurant use?

“I spent the first minute just trying to figure out who exactly we were designing for, a server, a host, kitchen staff, the owner?”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Google SWE coding round with one big open-ended system design question that even the interviewer seemed unsure about. The lack of structure made it hard to get into any real depth.
  • Design an elevator controller system. You're given the time a user pressed the button, their current floor, and their destination floor. No output is predefined. You need to define the outputs, classes, and interfaces yourself, and discuss strategies like fairness-first vs. path-first scheduling, as well as how you'd coordinate multiple elevators.

“The interviewer literally said at some point that the question was too open-ended, which was both reassuring and kind of unsettling.”

View Post

Google·Technical Program Manager·Onsite - Behavioral / Leadership

Apr 2026
Interviewed for a TPM role at Google and got hit with a scenario-based question about handling sick leave on a team right before a deadline. Short loop, nothing too wild, but the question had more layers than I expected.
  • A team member goes on sick leave right before a critical project deadline. How do you handle it?

“My first instinct was to jump straight into resource reallocation and I think that was the wrong move to lead with.”

View Post

Google·Software Engineer·Technical Phone Screen

Apr 2026
Google SWE interview with a dynamic programming problem that had a twist I didn't see coming. The O(n) constraint is what makes this one actually interesting.
  • Given an integer array and a target value, find the indices of the longest subsequence that sums to the target. The solution must run in O(n) time.

“The 'longest subsequence' part threw me off more than I expected.”

View Post

Google·Software Engineer·Technical Phone Screen

Apr 2026
Google software engineer interview with a classic array problem. Nothing too surprising but the O(n) HashMap approach is what they're looking for and you need to explain the tradeoff clearly.
  • Given an array of integers and a target value, return the indices of the two numbers that sum to the target. Each input has exactly one solution and you cannot use the same element twice.

“The brute force answer comes out naturally but you have to get to the HashMap solution on your own.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Google SWE coding round with a scheduling/greedy problem that looks straightforward but has a sneaky output requirement. The assignment tracking part is what gets you.
  • Given N car rental requests each with a pickup and return time, find the minimum number of cars needed to serve all requests without overlap (where return_time == next pickup_time is allowed on the same car). Also produce a valid assignment and store each request in the corresponding car's rental record, sorted chronologically.

“The minimum cars part I got pretty fast, it's basically an interval scheduling problem with a min-heap tracking when each car becomes free.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

Apr 2026
PM interview at Google with a classic product strategy question about sunsetting one of their own products. Short but deceptively tricky.
  • If you could shut down one Google product, which would it be and why?

“I froze for a second because picking something too obscure feels like a cop-out but picking something big feels risky.”

View Post

Google·Software Engineer·Technical Phone Screen

Apr 2026
Google SWE coding round, one question on stack-based expression parsing. Pretty straightforward if you know your stacks, but the output format tripped me up a bit.
  • Given a string in reverse Polish notation (e.g. "2,1,+,3,*"), convert it to a fully parenthesized infix expression (e.g. "(2+1)*3").

“I knew it was stack-related pretty fast but fumbled the parentheses logic for a minute.”

View Post