class Solution {

  findMinimumMeetingRooms(meetings) {
    let minRooms = 1;
    let localRooms = 1

    meetings.sort((a, b) => a.start - b.start)
    
    let overlupEnd = meetings[0].end

    for (let index = 1; index < meetings.length; index++) {
      const interval = meetings[index]

      if (overlupEnd > interval.start) {
        overlupEnd = Math.min(interval.end, overlupEnd)
        localRooms += 1
        minRooms = Math.max(minRooms, localRooms)
      }
      else {
        minRooms = Math.max(minRooms, localRooms)
        localRooms = 1
        overlupEnd = interval.end
      }
    }

    return minRooms;
  }
}