This is an interval scheduling maximization problem. The number of removed intervals equals total intervals minus kept intervals.
Greedy strategy: sort by end time. Always keep the interval that ends earliest because it leaves the most room for later intervals.
Walk through sorted intervals. If an interval overlaps with the last kept one, skip it (count as removed). Otherwise, keep it.