Given unlimited space, build a data-structer that can do: 1. insert any kind of data such as number/charachter 2. remember the order of insertion 3. at any given time, you can get a call that contain a rang to be deleted from the current data you have saved do far(e.g. 100-200) try to accomplish this faster than O(N)