Reevo·Software Engineer·Technical Phone Screen
Jun 2026
Interviewed for a software engineering role at reevo and got a graph traversal problem that looked straightforward until the lexicographic ordering requirement showed up. One coding round, algorithmic focus.
- Given an undirected graph with nodes labeled 1 through n, return the lexicographically largest DFS traversal sequence. Start from node 1 for its connected component, then handle remaining components by visiting each from its largest node, ordering the components themselves by their max node value descending.
“I got the basic DFS part fine but the multi-component ordering tripped me up for a bit.”