Pergunta de entrevista da empresa Microsoft

The most difficult / unexpected question I was asked was how to optimize an algorithm for removing duplicates from a sorted list beyond O(n). It turns out that the solution was still in O(n), but involved parallelism to improve run-time.