Google·Software Engineer·Technical Phone Screen
May 2026
Google SWE coding round with a sliding window / sorted structure problem about packing items from a conveyor belt into triplets. The problem sounded deceptively manageable at first glance but the online nature of it (streaming input, immediate output, removal) added real complexity.
- Design a class that accepts a stream of integer item sizes and, whenever any three stored items satisfy max minus min being strictly less than a given threshold, immediately returns one such sorted triplet and removes those three items from storage.
“I jumped straight to a sorted structure which was the right instinct, but I fumbled explaining why removal had to happen atomically and how I'd find the triplet efficiently.” 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