<div class="leaf flex"><div class="inner justify"><ul><li class="split-li ">that intersect and sort them. The result should be a group of sorted, non-intersecting intervals.</li><li>Now create a function to merge a new interval into a group of sorted, non-intersecting intervals. After the merge, all intervals should remain non-intersecting.</li><li>Given a list of meeting times, check if any of them overlap. The follow-up question is to return the minimum number of rooms required to accommodate all the meet