Tap here to switch tabs
Problem
Submissions

Problem: Meeting Rooms

Meeting Rooms gives an array of meeting intervals and asks whether one person can attend every meeting. Meeting end times are exclusive, so back-to-back meetings are allowed.

Statement

You are given an array of meeting times, intervals, where each interval consists of a pair of start and end times, identify whether or not a person can attend all the meetings.

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

Constraints:

  • 0≤0 \leq intervals.length ≤103\leq 10^3

  • intervals[i].length ==2== 2

  • 0≤0 \leq startistart_{i} << endiend_{i} ≤106\leq 10^6

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Meeting Rooms

Meeting Rooms gives an array of meeting intervals and asks whether one person can attend every meeting. Meeting end times are exclusive, so back-to-back meetings are allowed.

Statement

You are given an array of meeting times, intervals, where each interval consists of a pair of start and end times, identify whether or not a person can attend all the meetings.

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

Constraints:

  • 0≤0 \leq intervals.length ≤103\leq 10^3

  • intervals[i].length ==2== 2

  • 0≤0 \leq startistart_{i} << endiend_{i} ≤106\leq 10^6