Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Meeting Rooms
Bookmark
Brute Force
Sorting
Input
Has overlap
No overlap
Adjacent (no overlap)
Overlap at start
Single meeting
Custom
intervals
=
[[0,30],[5,10],[15,20]]
meetings (input order)
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings (input order)
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings (input order)
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings (input order)
pairs compared: 1
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
0 < 10 and 5 < 30 ?
meetings (input order)
pairs compared: 1
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
return false
algo
master
.
io
Step:
Start: Check if a person can attend all meetings
0 / 3
Input
Has overlap
No overlap
Adjacent (no overlap)
Overlap at start
Single meeting
Custom
intervals
=
[[0,30],[5,10],[15,20]]
0 / 3
algo
master
.
io
Step:
Start: Check if a person can attend all meetings
