Arrays and searching 0/120

Lesson 7 of 9

Greedy and intervals

Prove a greedy rule with an exchange argument, pick the most non-overlapping intervals by earliest finish, and merge and group sorted intervals.

4,786 words · 22 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 4

Further reading 3