← Questions
Fewest intervals to remove so one covers the rest
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a list of intervals, remove as few as possible so that among the remaining intervals at least one covers all the others. Return how many you remove.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding