Use a dummy node to handle edge cases where the head itself might be removed.

Traverse the list while comparing each node with the next one; if duplicates are found, skip all of them.

Maintain two pointers: one to track the last distinct node and another to traverse the list, updating links only when a distinct node is confirmed.