# 83 Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear onlyonce.

For example,\
Given`1->1->2`, return`1->2`.\
Given`1->1->2->3->3`, return`1->2->3`.

**Complexity**: O(n) time, O(1) space

**The Idea**: Iterate through the list of elements, and map each pointer to skip past the same consecutive list of elements.

```python
# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """

        iter = head
        while iter:
            temp_iter = iter.next
            while (temp_iter and iter.val == temp_iter.val):
                temp_iter = temp_iter.next
            iter.next = temp_iter
            iter = temp_iter

        return head
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/83-remove-duplicates-from-sorted-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.