Google·Software Engineer·Technical Phone Screen
May 2026
Google SWE coding round, one algorithmic problem about grouping two-digit integers by their digit composition. Pretty focused session, just the one problem with some back-and-forth on the approach.
- Given an array of two-digit integers (10-99), group numbers that share the same digits regardless of order. Return the size of the largest such group. For example, 12, 21, and any other permutation of those digits belong together.
“The example they gave makes it click pretty fast: 12 and 21 are the same group, 34 and 43 are the same group.” The rest of the author's notes on Software Engineer interview at Google, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post