# Meeting Rooms III

Try to solve the Meeting Rooms III problem.

## We'll cover the following

## Statement

You have an integerÂ `rooms`

, representing room numbers from `0`

toÂ `roomsâˆ’1`

. Additionally, you are given an `meetings`

, where each elementÂ `meetings[i]`

= **half-closed** intervalÂ

Meetings are allocated to rooms in the following manner:

Each meeting will take place in the unused room with theÂ

**lowest**Â number.If there are no available rooms, the meeting will be delayed until a room becomes free, maintaining the

**same**duration as the original meeting.When a room is vacated, the meeting with the earliest original

**start**time is given priority for that room.

Your task is to determine the **room number** that hosted the highest number of meetings. If there are multiple rooms, returnÂ the room with theÂ **lowest**Â number.

Note:AÂhalf-closed intervalÂ[a, b)Â is the interval betweenÂaÂ andÂbÂincludingÂaÂ andÂnot includingÂb.

**Constraints:**

$1 \leq$ `rooms`

$\leq 100$ $1 \leq$ `meetings.length`

$\leq 1000$ `meetings[i].length`

==$2$

## Example

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.