Question

You are given meetings as a list of [start, end) half-open intervals. There are exactly n rooms numbered 0..n-1. Meetings are assigned greedily: process meetings in order of start time (break ties by the earlier start, then by the order given), and assign each meeting the lowest-numbered room that is free; if all rooms are busy, the meeting is delayed until the earliest room frees up, keeping its original duration but starting when that room becomes free (still preferring the lowest-numbered room among those that free at that time). Return the room number that held the most meetings (ties broken by lowest room number). n is up to 100 and there are up to 10^4 meetings; times fit in 64-bit ints.