Skip to content

Pattern drills

Read a problem and name the pattern before you write any code. The patterns are mixed, so the clue has to come from the problem itself.

Question 1 of 10

Fewest Ranges to Remove

You are given a list of ranges intervals, each [start, end] with start < end. Return the smallest number of ranges you must remove so that no two of the remaining ranges overlap.

Here, ranges that only touch at an end point do not overlap: [1, 3] and [3, 5] can both stay.

Which pattern fits best?

This round

0right so far

Rounds of 10, patterns mixed. Naming the pattern is the skill interviews test first.