Google·Software Engineer·Technical Phone Screen
Apr 2026
Phone screen for a Google SWE role, one coding problem the whole time. It was a Wordle-style puzzle with a real algorithmic twist, not just grind-leetcode stuff, which I appreciated even if I fumbled parts of the follow-up.
- You have a hidden 5-letter word and a black-box oracle that takes a position and a letter, returning true if that letter is at that position. Design an algorithm to identify the word while minimizing the total number of oracle calls. No dictionary available.
- Now assume you have a dictionary of valid 5-letter words. How would you redesign the strategy to use that information and reduce expected oracle calls further?
“My first instinct was just brute force, 5 positions times 26 letters, 130 calls worst case.” 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