Meeting Rooms

EasyIntervalssorting

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

You are given a list of meetings intervals, where intervals[i] = [start, end] describes a meeting that runs from start up to (but not including) end, with start < end. Return true if one person could attend every meeting, meaning no two meetings overlap. A meeting that ends at time t does not conflict with one that starts at time t. The meetings are not given in any particular order.

Examples

Input: intervals = [[0,30],[5,10],[15,20]]
Output: false
[5,10] happens during [0,30].
Input: intervals = [[7,10],[2,4]]
Output: true
The meetings [2,4] and [7,10] do not overlap.
Input: intervals = [[1,5],[5,8]]
Output: true
The first meeting ends exactly when the second begins, which is allowed.

Constraints

  • 0 <= intervals.length <= 10^4
  • intervals[i].length == 2
  • 0 <= start < end <= 10^6

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More sorting problems