title: Is it possible to remove duplicates from a sorted list in less than O(n) time?
body: <p>I suspect there is a way if you can save by locating the other end of a range of repeated values faster than by iterating through that sublist</p>