Data Structures19 sections · 729 units
Open in Course

Problem - Meeting Rooms

Check for conflicts

Given an array of meeting time intervals [start,end][\text{start}, \text{end}], determine if a person could attend all meetings (no overlaps).

Example: [[0,30],[5,10],[15,20]][[0,30], [5,10], [15,20]] returns false because [0,30][0,30] overlaps with both other meetings. This is interval overlap detection. Can any two intervals overlap? Constraints: up to 10410^4 meetings.