dYdX·Software Engineer·Technical Phone Screen
May 2026
Two-part graph problem interview for a software engineering role at dYdX. Part A was a fairly standard BFS shortest path question, Part B was trickier and involved dynamic programming over a labeled graph to minimize mismatches along a path of fixed length.
- Given an undirected, unweighted graph, find the shortest path between two nodes and return both the path length and the actual vertex sequence. What is your algorithm and its time and space complexity?
- Each vertex in a graph has a string label. Given a target sequence of labels of length m, find a path of exactly m vertices in the graph that minimizes the number of positions where the vertex label does not match the target label. Return one such optimal vertex sequence.
“BFS, obviously.”