sage·Software Engineer·Technical Phone Screen
Jun 2026
Interviewed for a Software Engineer role at Sage and got a graph traversal question that started simple but had a follow-up I wasn't fully prepared for. The BFS optimization angle is what made it interesting.
- Given a set of rooms connected by edges, find the minimum number of steps to get from a source room to a target room using BFS. Then optimize your approach using bidirectional BFS and explain the tradeoffs.
“The basic BFS part was fine, I coded it up without much trouble.”