Solve problems in merging intervals, inserting and finding intersections of intervals, scheduler tasks, and determining employee free time.

Central CIP Path

Merge Intervals

# 
# Statement

We are given an input array of meeting time intervals, `intervals`, where each interval has a start time and an end time. Your task is to find the minimum number of meeting rooms required to hold these meetings.

> An important thing to note here is that the specified end time for each meeting is exclusive.


**Constraints**
* $1 <=$ `intervals.length` $<= 10^{3}$
* $0$ $\leq$ $start_{i}$ $\lt$ $end_{i}$ $\leq$ $10^{6}$

# Examples

Try to solve the Meeting Rooms II problem.

Problem: Meeting Rooms II

Statement

Examples