Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
Related questions
Continue with questions that share topics or the same question type.
- Return the Lexicographically Smallest Topological Order
Coding · Graphs · Heaps & Priority Queues
- Design a Version-Aware Package Download Service That Fetches Missing Dependencies
System design · Graphs · System Design · System Design Fundamentals
- Expiring GPU Credit Ledger with Out-of-Order Events and Point-in-Time Balance
Practical engineering · Data Structure Design · Heaps & Priority Queues
- Fault-Tolerant Task Queue with Retries, a Dead-Letter Queue and Task Dependencies
Practical engineering · Data Structure Design · Graphs
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
PracHub · 1 record
OpenAI
Order Tasks with Dependencies Using a Deterministic Topological Sort
Reported Sep 17, 2026
SOFTWARE ENGINEER
Source snapshot: Nov 12, 2026