Longest Available Seat Segments

MEDIUM20 pts

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

Table: Cinema

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:

Example

Input

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

Output

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

Explanation

The free runs are [1] and [3,4,5]. The longest run length is 3, so only seats 3..5 are returned.

Example

Input

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

Output

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

Explanation

Two longest runs tie at length 2, so both are included.

Example

Input

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

Output

[]

Explanation

No available seats exist, so no segment can be formed.

Accepted0/0·0% Acceptance

Constraints

Code

Visualizer

Solutions

14px

Test Cases3

Results

Submissions

Cinema =

[{"seat_id":1,"free":1},{"seat_id":2,"free":0},{"seat_id":3,"free":1},{"seat_id":4,"free":1},{"seat_id":5,"free":1}]