[leetcode] 83. Remove Duplicates from Sorted List

 

Time Complexity: O(n) where n is the number of nodes in the linked list.

Space Complexity: O(1) as we use constant amount of space for variables.

 

function deleteDuplicates(head: ListNode | null): ListNode | null {  
    let current = head
    while(current) {
        if(current.val === current?.next?.val) {
            current.next = current?.next?.next
        } else {
            current = current.next
        }
    }
    return head
};