Google·Software Engineer·Technical Phone Screen
- Given a string, count the number of ways to split it into parts according to some defined criteria.
“Classic combinatorics-meets-string-manipulation type problem.”
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
“Classic combinatorics-meets-string-manipulation type problem.”
“Pretty standard opener but I still fumbled it a bit.”
“This is the kind of question where you can go in a hundred directions and that's kind of the problem.”
“Classic unbounded knapsack variant but I kept second-guessing whether order mattered (it doesn't, combinations not permutations).”
“I rambled about shipping features and collaborating with teammates, which felt fine in the moment but probably came across as generic.”
“Jumped straight to the nested loop solution which is fine, it's O(N^2) and the output is literally N*(N-1)/2 entries so there's not much you can do about space.”
“I went straight to engagement metrics and kind of rambled about DAUs and match rates before realizing I hadn't even defined what 'success' means for a two-sided marketplace like this.”
“Looks easy until you start thinking about edge cases.”
“This one tripped me up more than I expected.”
“This question is doing three jobs at once and I didn't realize that fast enough.”