Glean·Software Engineer·Technical Phone Screen
Apr 2026
Glean coding round, one meaty simulation problem that took up the whole session. Not the usual leetcode grind, which I appreciated, but it also meant there was nowhere to hide if you didn't know your heap stuff cold.
- Build a priority-based job scheduler that processes a stream of jobs, each with an arrival time, duration, and priority. The processor is non-preemptive, so once a job starts it runs to completion. Return the completion order and each job's start time, finish time, and wait time.
“The non-preemptive constraint is the key thing to get right early.” The rest of the author's notes on Software Engineer interview at Glean, 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