viewing: 6B731DED0F466FD4CD5EF303EA9DB15C7B9E17C1C93A76ABDF50B3A1A65293EC
# Remove Duplicates from Sorted List (LeetCode 83): Interview Notes ## Problem Given the `head` of a sorted linked list, delete all duplicates so each element appears only once. Return the linked list sorted as well. ## Approach One pointer `cur`. While `cur` and `cur.next` exist, if values match skip `cur.next`; else advance `cur`. Because the list is sorted, duplicates are adjacent — no hash set needed. Mention the unsorted variant (LC 82 / LC 1836 style) only if asked. ## Complexity Time O(n), space O(1). ## Practice tip Warm up pointer narration with [Linkjob.ai](https://www.linkjob.ai/). *Disclosure: I work on Linkjob AI.*