Separate all start times and end times, sort each list, and sweep through them with two pointers to track how many meetings are active concurrently.

Meeting Rooms II

medium

Acceptance: 45%

IntervalsSortingHeap

Given a list of meeting time intervals [start, end], determine the fewest meeting rooms needed so that no two overlapping meetings share a room.

Example 1:

Input:intervals = [[0,25],[5,15],[10,20]]

Output:2

Example 2:

Input:intervals = [[3,8],[9,14]]

Output:1

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}