Intervals/Meeting RoomsEasy

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Meeting Rooms

Intervals·Easy

Given an array of meeting time intervals intervals where intervals[i] = [start_i, end_i], determine if a person could attend all meetings.

Two meetings that share only an endpoint (one ends exactly when the next begins) do not count as a conflict.

Examples

Input: intervals = [[0,30],[5,10],[15,20]]

Output: false

[0,30] overlaps with both [5,10] and [15,20].

Input: intervals = [[7,10],[2,4]]

Output: true

Input: intervals = [[1,5],[5,10]]

Output: true

End-touch is allowed.

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Complete approach — pattern and complexity both named.

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

No divergence detected. The code correctly aligns with the stated approach.

Try solving related sliding window problems to build familiarity with two-pointer variants.

No signals fired — clean run, you stayed in flow.