Glean·Machine Learning Engineer·Technical Phone Screen
Apr 2026
Coding screen for an MLE role at Glean. The problem was graph-flavored but dressed up as a train scheduling puzzle, which threw me off a bit at first. Decent interview overall, felt like they wanted to see how you think about reachability and complexity rather than just code.
- You're given a train schedule as a list of trains, where each train is a list of station names and the index represents arrival time. Implement a function that returns whether a passenger can travel from a start station to an end station, given that passengers can transfer between trains at shared stations even if they arrive at different times (i.e. they can wait). Follow-ups include discussing complexity, finding shortest travel time with wait, and finding all reachable stations from a given start.
“My first instinct was to just do a DFS over stations, but the waiting mechanic made me second-guess myself for a minute.” The rest of the author's notes on Machine Learning 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