Remove Covered Intervals

Given a list of half-open intervals [l, r), remove any interval that is fully contained within another (c ≤ a and b ≤ d) and return the count of remaining intervals. A common approach is to sort by start (and end descending on ties) and sweep while tracking the farthest end to detect covered intervals.