Modular·Software Engineer·Technical Phone Screen
Mar 2026
Got a coding problem at Modular for a software engineer role that was all about graph traversal. The problem itself was well-defined but required you to think carefully about both the computation and the reconstruction of the path, not just the length.
- Given a list of tasks with names, dependencies, and durations representing a directed acyclic graph, compute the critical path length (longest path by total duration) and output the actual sequence of tasks on that path. Multiple test graphs may be given.
“The length part I got pretty quickly, topological sort plus a running max.”