Google·Software Engineer·Technical Phone Screen
Jun 2026
Google SWE interview with a calendar scheduling problem that looks straightforward until you start thinking about overlapping busy intervals, merging, and edge cases. Clean algorithmic problem but there's more to it than a first glance suggests.
- Given a working window and a list of per-participant busy intervals, find all maximal time slots where every participant is simultaneously free and the slot is at least a given minimum duration long. Intervals are half-open and may overlap or be out of order.
“My first instinct was to iterate per-person and intersect free windows, which works but gets messy fast when intervals overlap within a single person's schedule.” 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