It's a generic interview question and you can literally find an answer in every interview preparation book. I've used a hash table solution to get O(n) time and space complexity, but mentioned it is possible to solve this problem in O(n log n) time and O(1) space. You're also supposed to know about memory management, as list nodes are dynamically allocated.