Home
Log in
DescriptionSubmissionsSolution
DescriptionSubmissionsSolution
Loading...

Log in to run or submit

intervals =

Codey

Practise coding problems, test your solutions and track your progress.

Explore

  • Problems
  • About
  • Contact

Legal

  • Privacy Policy
  • Terms of Use

© 2026 Codey. Personal learning project.

Solution
Updated: 2026-02-23

Idea

Meetings conflict if any adjacent intervals overlap after sorting by start.

Approach

Sort by start time, then ensure start[i] >= end[i-1] for all i.

Code
Loading...
Complexity
Time: O(n log n)
Space: O(1) extra
Solution
Updated: 2026-02-23

Idea

Meetings conflict if any adjacent intervals overlap after sorting by start.

Approach

Sort by start time, then ensure start[i] >= end[i-1] for all i.

Code
Loading...
Complexity
Time: O(n log n)
Space: O(1) extra