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.
- Order Tasks with Dependencies Using a Deterministic Topological Sort
Coding · Graphs · Heaps & Priority Queues
- Expiring GPU Credit Ledger with Out-of-Order Events and Point-in-Time Balance
Practical engineering · Data Structure Design · Heaps & Priority Queues
- GPU Credit Ledger with Expiring Grants, Out-of-Order Operations and Fast Balances
Practical engineering · Data Structure Design · Heaps & Priority Queues
- Implement a GPU credit ledger with expiring grants and out-of-order operations
Practical engineering · Data Structure Design · Heaps & Priority Queues
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
Return the Lexicographically Smallest Topological Order
Reported Aug 1, 2026
SOFTWARE ENGINEER
Source snapshot: Nov 12, 2026