Simulate room assignments for scheduled meetings

Problem Statement

You are given a set of meetings, where each meeting is represented as [start_time, end_time]. You have n meeting rooms labeled 0 to n-1. All rooms are initially empty.

When a meeting is scheduled, follow these rules:

1. If a room becomes free, the meeting is assigned to the room with the smallest index.
2. If no room is free at the meeting's start_time, the meeting is delayed until the first available room becomes free. If multiple rooms become free at the same time, the meeting is assigned to the room with the smallest index.
3. If multiple meetings start at the same time, process them in the order of their original start_time (or based on the input order if start times are identical).

Your task is to return the index of the room that held the most meetings. If there is a tie, return the room with the smallest index.

Function Signature

def mostBooked(n: int, meetings: list[list[int]]) -> int:

Constraints

• 1 <= n <= 100
• 1 <= meetings.length <= 10^5
• 1 <= start_time < end_time <= 10^5

Example 1

Input: n = 2, meetings = [[0,10],[1,5],[2,7],[3,4]] Output: 0 Explanation:

• Room 0 takes [0,10].
• Room 1 takes [1,5].
• Meeting [2,7] is delayed until time 5 (Room 1).
• Meeting [3,4] is delayed until time 10 (Room 0).
• Room 0 held 2 meetings, Room 1 held 2 meetings. Return 0.

Edge Cases

• n is greater than the number of meetings.
• All meetings have the same start time.