Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Number of Events That Can Be Attended
Bookmark
Input
Sequential
With duplicate
LeetCode Example
All same day
Custom
events
=
[[1,2],[2,3],[3,4]]
events
[1,2]
[2,3]
[3,4]
heap (end days):
(empty)
Events attended:
0
events
[1,2]
[2,3]
[3,4]
heap (end days):
(empty)
Events attended:
0
events
[1,2]
[2,3]
[3,4]
heap (end days):
(empty)
Events attended:
0
events
[1,2]
[2,3]
[3,4]
day=1
heap (end days):
(empty)
Events attended:
0
events
[1,2]
[2,3]
[3,4]
day=1
heap (end days):
2
Events attended:
0
events
[1,2]
[2,3]
[3,4]
day=2
heap (end days):
(empty)
Events attended:
1
events
[1,2]
[2,3]
[3,4]
day=2
heap (end days):
3
Events attended:
1
events
[1,2]
[2,3]
[3,4]
day=3
heap (end days):
(empty)
Events attended:
2
events
[1,2]
[2,3]
[3,4]
day=3
heap (end days):
4
Events attended:
2
events
[1,2]
[2,3]
[3,4]
day=4
heap (end days):
(empty)
Events attended:
3
events
[1,2]
[2,3]
[3,4]
heap (end days):
(empty)
Events attended:
3
algo
master
.
io
Step:
Find the maximum number of events that can be attended
0 / 13
Input
Sequential
With duplicate
LeetCode Example
All same day
Custom
events
=
[[1,2],[2,3],[3,4]]
0 / 13
algo
master
.
io
Step:
Find the maximum number of events that can be attended
