Return a Valid Dependency Order for Named Tasks
Company: Citadel
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: Solve a named-task dependency graph with deterministic topological sorting and explicit cycle detection. Learn to include dependency-only tasks, deduplicate edges, and use a heap for lexicographic tie-breaking.
Read the full Citadel Software Engineer interview experience this question came from