Skip to main content
Meeting Rooms II | AlgoCracked
AlgoCracked
ProblemsMeeting Rooms II
Medium51.0% acceptance
ArraySortingHeapGreedy

Meeting Rooms II

Given an array of meeting time intervals where intervals[i] = [start, end] , return the minimum number of conference rooms required so that no two overlapping meetings share a room. Meetings that only touch at an endpoint can reuse the same room. Input format Input is [intervals] , e.g. [[[0,30],[5,10],[15,20]]] .

Loading workspace…