Удалить дубликаты из двусвязного списка

Hello I stumbled following question You given unsorted doubly linked list.You should find and delete duplicates from Doubly linked list.

What is the best way to do it with minimum algorithmic complexity?

Thank you.