Available question text
Produce an ordering of all directed matches between n teams (each ordered pair i != j appears exactly once, representing home/away) so that no team appears in consecutive matches; return the sequence of matches (one per day) or an empty array if no such ordering exists.
Related questions
Continue with questions that share topics or the same question type.
- Course Schedule
Coding · Breadth-First Search · Depth-First Search · Directed Acyclic Graph
- Course Schedule II
Coding · Breadth-First Search · Depth-First Search · Graph Theory
- Course Schedule III
Coding
- Course Schedule IV
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3680. Generate Schedule
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source