Tennis Club Scheduling - Coding Interview

Question

## Problem

A tennis club has `C` courts and receives booking requests as `(player_id, start_time, end_time)`. Process requests in order of arrival. Assign a request to any available court. If all courts are busy, add the request to a wait queue; it will be assigned when the earliest-ending match finishes.

Return the final assignment list: `(player_id, court_id, actual_start_time)`.

```python
def schedule_courts(
    num_courts: int,
    requests: list[tuple[str, int, int]]
) -> list[tuple[str, int, int]]:
    ...
```

**Example:**
```
num_courts = 2
requests = [("A",0,60),("B",0,90),("C",10,70),("D",20,50)]
Output: [
  ("A", 1, 0),
  ("B", 2, 0),
  ("C", 1, 60),   # court 1 free at 60, C plays 60->120
  ("D", 1, 120)   # or court 2 free at 90 -> D at 90
]
```

## Follow-ups
- What priority queue operations are needed, and what is the overall time complexity?
- How do you handle a request where `end_time - start_time` varies (duration-based rather than fixed end)?
- Extend to support VIP players who jump the wait queue.

Tennis Club Scheduling - Coding Interview

Question Details

Full Details

Topics

More from Atlassian