Similar to https://leetcode.com/problems/non-overlapping-intervals/,
but the question has been changed to at least how many removals do you have to perform to get a intervals with each intervals overlapped by at most two other intervals?