Problem solving with programming: Deleting duplicate elements from a sorted linked list

Problem solving with programming: Deleting duplicate elements from a sorted linked list

Given a sorted linked list, how do we delete duplicate nodes from it?

This question is simple and straightforward, we take two pointers, current and next which points the adjacent nodes. In each iteration we compare the values at these two nodes, if they are equal, we delete the node pointed by next and advance the two pointers. Take a look at the following diagram to get better understanding.

Read full article from Problem solving with programming: Deleting duplicate elements from a sorted linked list