Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Meeting Rooms II
Bookmark
Brute Force
Sorting + Min-Heap
Chronological
Input
Standard (2 rooms)
No overlap (1 room)
Sequential (1 room)
All overlap (4 rooms)
Partial overlap (2 rooms)
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)
count: 0 best: 0
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings running at 0: 0
meetings (input order)
count: 1 best: 0
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings running at 0: 1
meetings (input order)
count: 1 best: 1
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
count = 1, maxRooms = 1
meetings (input order)
count: 1 best: 1
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings running at 5: 1
meetings (input order)
count: 2 best: 1
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings running at 5: 2
meetings (input order)
count: 2 best: 2
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
count = 2, maxRooms = 2
meetings (input order)
count: 1 best: 2
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings running at 15: 1
meetings (input order)
count: 1 best: 2
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
meetings running at 15: 1
meetings (input order)
[0,30]
[5,10]
[15,20]
0
5
10
15
20
25
30
min rooms = 2
algo
master
.
io
Step:
Start: find the minimum number of rooms for all meetings
0 / 26
Input
Standard (2 rooms)
No overlap (1 room)
Sequential (1 room)
All overlap (4 rooms)
Partial overlap (2 rooms)
Custom
intervals
=
[[0,30],[5,10],[15,20]]
0 / 26
algo
master
.
io
Step:
Start: find the minimum number of rooms for all meetings
