bnsf Railway·Software Engineer·Technical Phone Screen
Jun 2026
Interviewed for a software engineering role at BNSF Railway and got hit with a graph traversal problem. Nothing too wild but it required knowing your BFS fundamentals cold.
- Given an undirected unweighted graph with a set of source nodes and a set of target nodes, how would you compute the shortest distance from every node to its nearest source?
“Multi-source BFS is the move here.”