Google·Software Engineer·Technical Phone Screen
- Generate all valid combinations of n pairs of parentheses.
“Knew it was backtracking pretty fast but fumbled the base case the first time around.”
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
“Knew it was backtracking pretty fast but fumbled the base case the first time around.”
“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.”
“The constraint here is that all three levers are locked, which is the whole point.”
“This one took me a minute to even parse what they were asking.”
“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.”
“Spent the first minute just trying to figure out what angle they wanted.”
“Sorted binary array means all the 0s come first, then all the 1s.”
“Classic Kadane's algorithm problem.”
“I started by asking clarifying questions about scale and use cases, which felt right, but then I kind of froze on the schema side.”
“Seemed like a soft opener but I fumbled it a bit.”