Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
Which greedy rule selects the maximum number of non-overlapping intervals?
A
Pick the interval that starts earliest
B
Pick the longest interval first
C
Repeatedly pick the interval that ends earliest and discard overlapping ones
D
Pick the shortest interval first