L17 INTEGRATED EXERCISE - PROBLEM A
Hall booking turnaround conflicts
Label: AI allowed — keep a record. Your specification and your tests are
your own unaided work. Generation of the implementation is assisted.

SITUATION
Riverside Community Hall (invented) has one main room that is booked by
several groups a day. The hall manager builds the day's schedule by hand
and keeps missing turnaround problems. After one booking ends, the room
needs at least 45 minutes empty (clear the tables, clean, hand over the
key) before the next booking can start.

The schedule arrives as a Python list. Each booking is itself a list of
three items: the booking id, the start time, and the end time. Times are
whole minutes counted from midnight, so 0830 is 510 and 1415 is 855.

    day = [["K21", 480, 570], ["K22", 600, 690], ["K23", 735, 800]]

TASK
Write a function named find_conflicts that takes one schedule list and
reports every pair of bookings that cannot both be held in this room
because the turnaround time is not met. The manager wants to fix every
conflict before the schedule is published, so a missed conflict is a
serious error (two groups arrive at once) and a false alarm wastes the
manager's morning.

WHAT YOU PRODUCE (use L17_submission_template.txt)
1. Specification and acceptance criteria. State the inputs, the output
   (its exact form), the constraints, and the criteria that decide
   whether a result is correct. Surface every assumption you had to make.
2. Tests, written from your criteria before you read any generated code.
3. The implementation you are signing for.
4. A correction record for every failure.
5. A complete AI-use record.

Time: about 10 minutes for item 1, with no assistant. Then about 22
minutes for items 2 to 4. Set a timer; the time limits are part of the
exercise.
