Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Number of Events That Can Be Attended
Bookmark
Greedy with Set
Sorting + Min-Heap
Input
Sequential
With duplicate
LeetCode Example
All same day
Custom
events
=
[[1,2],[2,3],[3,4]]
events (sorted by end day)
[1,2]
[2,3]
[3,4]
used days:
(empty)
Events attended:
0
events (sorted by end day)
[1,2]
[2,3]
[3,4]
used days:
(empty)
Events attended:
0
events (sorted by end day)
[1,2]
[2,3]
[3,4]
used days:
(empty)
Events attended:
0
events (sorted by end day)
[1,2]
[2,3]
[3,4]
day=1
used days:
(empty)
Events attended:
0
events (sorted by end day)
[1,2]
[2,3]
[3,4]
day=1
used days:
(empty)
Events attended:
0
events (sorted by end day)
[1,2]
[2,3]
[3,4]
day=1
used days:
1
Events attended:
1
events (sorted by end day)
[1,2]
[2,3]
[3,4]
day=2
used days:
1
Events attended:
1
events (sorted by end day)
[1,2]
[2,3]
[3,4]
day=2
used days:
1
2
Events attended:
2
events (sorted by end day)
[1,2]
[2,3]
[3,4]
day=2
used days:
1
2
Events attended:
2
events (sorted by end day)
[1,2]
[2,3]
[3,4]
day=3
used days:
1
2
3
Events attended:
3
events (sorted by end day)
[1,2]
[2,3]
[3,4]
used days:
1
2
3
Events attended:
3
algo
master
.
io
Step:
Find the maximum number of events that can be attended
0 / 12
Input
Sequential
With duplicate
LeetCode Example
All same day
Custom
events
=
[[1,2],[2,3],[3,4]]
0 / 12
algo
master
.
io
Step:
Find the maximum number of events that can be attended
