Google·Software Engineer·Technical Phone Screen
May 2026
Google SWE interview focused entirely on a computational geometry problem about square overlaps on a 2D plane. No coding required, just a verbal walkthrough of multiple approaches and their trade-offs. Pretty niche problem but the discussion format actually made it more interesting than I expected.
- Given N axis-aligned squares on a 2D plane, each defined by a bottom-left corner and side length, find the maximum area covered by the largest simultaneous overlap of any subset of these squares. Discuss multiple approaches verbally, including their time and space complexity trade-offs.
“The brute force angle was easy enough to talk through, O(N^2) pairwise intersections, nothing fancy.” 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