We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
A set of intervals is given. Each intervals can overlap with the others. If a point is overlapped by just two intervals, it is fine. If a point is overlapped by three or more intervals, it is bad.
What you should do is to find the largest subset (of intervals) that does not have a bad overlap. And return the size of the subset.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Interval Selection
You are viewing a single comment's thread. Return to all comments →
A set of intervals is given. Each intervals can overlap with the others. If a point is overlapped by just two intervals, it is fine. If a point is overlapped by three or more intervals, it is bad.
What you should do is to find the largest subset (of intervals) that does not have a bad overlap. And return the size of the subset.