Easy · Intervals

Schedule meetings

Given an array intervals of meetings {start, end} (start < end) in any order, return true if one person can attend all of them, meaning no two meetings overlap (a meeting may start exactly when another ends), and false otherwise.

Examples

Example 1

[0,30] [5,10] [15,20] → false

Output: conflict

Example 2

[7,10] [2,4] → true

Output: can attend all

Rebuild it in the studio

Read every interview problem free. Ten rooms need no account. A token opens a problem in full — Pro never counts.

More Intervals problems