CodeMosa
Master LeetCode Patterns
All Patterns
Collections
Sign In
Back
Greedy Algorithms
Question 1 of 12
8% Complete
Easy
Interval scheduling to maximize non-overlapping intervals chooses...
A
Intervals with earliest finishing time first
B
Longest intervals first
C
Earliest start time
D
Random order