← Back to Directory

Google interview notes, page 114 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·Technical Phone Screen

May 2026
Google SWE interview with a classic backtracking problem. Not much to say except it's the kind of question that feels easy until you're actually writing it out under pressure.
  • Generate all valid combinations of n pairs of parentheses.

“Knew it was backtracking pretty fast but fumbled the base case the first time around.”

View Post

Google·Product Manager·Onsite - Behavioral / Leadership

May 2026
Went through a behavioral round for a PM role at Google. Just the one question but it was clearly meant to probe process thinking and ownership.
  • Tell me about a time you improved a process that was genuinely complicated.

“I had a decent example ready but I spent too long on the backstory and barely got to the actual impact before they moved on.”

View Post

Google·Technical Program Manager·Hiring Manager Screen

May 2026
Google TPM interview with a classic resource constraint scenario. One question, no fluff, just a situation designed to see if you'll push back or fold.
  • You need to deliver 12 features in 6 months, but your team can realistically only build 6 in that time. Stakeholders refuse to move the deadline, cut scope, or add budget. What do you do?

“The constraint here is that all three levers are locked, which is the whole point.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Got a Google SWE interview that was purely algorithmic, one problem about finding all bad pairs among a set of tests using a black-box oracle function. Pretty niche problem, not your typical LeetCode grind.
  • You have n atomic tests and a black-box function that returns true if a given subset contains no incompatible test pairs, and false otherwise. Design an algorithm to find all bad (incompatible) pairs using as few calls to this function as possible, analyze the call complexity in terms of n and k (number of bad pairs), and argue correctness.

“This one took me a minute to even parse what they were asking.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Google SWE interview with a tree problem that sounds straightforward until you realize the data structure is weirder than a standard BST. One question, but it had some teeth to it.
  • You're given a ternary tree where each node can have up to three children: a left child with a smaller value, a middle child with an equal value, and a right child with a larger value. Find the mode (most frequently occurring value) across all nodes in the tree.

“My first instinct was to just do a traversal and count frequencies in a hashmap, which works, but then I realized the middle child structure is literally storing duplicates for you in the tree itself.”

View Post

Google·Product Manager·Onsite - Product Sense / Strategy

May 2026
Google PM interview, one question about monetizing a third-party product. Short and a bit disorienting since it wasn't about Google's own stuff.
  • How would you monetize Spotify?

“Spent the first minute just trying to figure out what angle they wanted.”

View Post

Google·Software Engineer·Technical Phone Screen

May 2026
Google coding screen, pretty stripped down. Just the one problem and not a lot of context around it.
  • Given a sorted binary array, find the total count of 1s in it.

“Sorted binary array means all the 0s come first, then all the 1s.”

View Post

Google·Software Engineer·Onsite - Coding / Algorithms

May 2026
Google SWE coding round, one dynamic programming problem. Pretty standard stuff but it's easy to overthink these when you know it's Google.
  • Given an array of integers, find the contiguous subarray with the maximum sum and return that sum. The array length is at most 100 and values range from -100 to 100.

“Classic Kadane's algorithm problem.”

View Post

Google·Software Engineer·Onsite - System Design / Architecture

May 2026
Got a system design question for a Google role that was basically 'design the database behind Google Translate.' Not a ton of context given, just that one question and you figure it out from there.
  • How would you design a database to support a translation service like Google Translate?

“I started by asking clarifying questions about scale and use cases, which felt right, but then I kind of froze on the schema side.”

View Post

Google·Software Engineer·Hiring Manager Screen

May 2026
Interviewed for a bizops role at Google, just one question to go off of here so not much to say about the full loop.
  • How did your most recent project end?

“Seemed like a soft opener but I fumbled it a bit.”

View Post