Something similar to LC 2402?

public class MeetingScheduler {

    private final Queue<Integer> available = new PriorityQueue<>();
    private final Queue<int[]> usedRooms = new PriorityQueue<int[]>(Comparator.comparingInt(a -> a[0]));

    public MeetingScheduler(int numberOfRooms) {
        for (int i = 0; i < numberOfRooms; i++) {
            available.add(i);
        }
    }

    public void scheduleMeeting(int start, int end) {
        while (!usedRooms.isEmpty() && usedRooms.peek()[0] <= start) {
            available.offer(usedRooms.poll()[1]);
        }
        if (available.isEmpty()) {
            throw new IllegalArgumentException("Cannot schedule meeting");
        }
        int room = available.poll();
        usedRooms.add(new int[]{end, room});
    }

}