Google·Software Engineer·Onsite - Coding / Algorithms
Jun 2026
Google SWE coding round, one question the whole time, interval scheduling. Spent a decent chunk of the session just clarifying the problem before writing a single line, which felt risky but probably saved me from going down the wrong path.
- Given a set of meetings and a number of available rooms, assign each meeting to a room such that the room with the smallest index is always preferred when multiple rooms are free. Return the room that held the most meetings.
“The two-heap setup is the move here: one min-heap tracking free rooms by index, another tracking busy rooms by end time.” The rest of the author's notes on Software Engineer interview at Google, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post