Your question is Efficient Ordered Range Deletions. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Given unlimited space, how would you build a data structure that supports ordered insertion and faster-than-O(N range deletions?