Algorithm · Bloomberg · Hard
Requirements For an even integer n, generate every legal round-robin fixture containing n - 1 rounds. A round contains n / 2 non-overlapping matches, and over the full fixture each unordered matchup (i, j) where i < j must occur one time only. When n is odd, exactly one participant receives a bye in every round; confirm with the interviewer whether bye handling is expected. Function signature: Examples Each of the six distinct pairings among teams 0 through 3 is used once,…
Checking your access…