Longest Available Seat Segments

A cinema operations system stores seat availability snapshots in a table.

Table: Cinema

• seat_id: unique integer identifier of a seat
• free: 1 if the seat is available, 0 if occupied

Task: Return every maximum-length available segment.

Definition:

• A segment is a maximal contiguous run of seats where:
  • free = 1, and
  • seat_id values are consecutive integers.

Output requirements:

• Return exactly these columns in this order:
  1. first_seat_id
  2. last_seat_id
  3. consecutive_seats_len
• Include all segments tied for the largest length.
• Sort rows by first_seat_id ascending.
• If no seat is free, return an empty result.

Supported submission environments:

• SQL (SQLite 3.27.2)
• Pandas (Python)

Cinema:
| seat_id | free |
|---------|------|
| 1       | 1    |
| 2       | 0    |
| 3       | 1    |
| 4       | 1    |
| 5       | 1    |

[
  {"first_seat_id": 3, "last_seat_id": 5, "consecutive_seats_len": 3}
]

Cinema:
| seat_id | free |
|---------|------|
| 10      | 1    |
| 11      | 1    |
| 12      | 0    |
| 13      | 1    |
| 14      | 1    |

[
  {"first_seat_id": 10, "last_seat_id": 11, "consecutive_seats_len": 2},
  {"first_seat_id": 13, "last_seat_id": 14, "consecutive_seats_len": 2}
]

Cinema:
| seat_id | free |
|---------|------|
| 7       | 0    |
| 8       | 0    |
| 9       | 0    |

[]