Tap here to switch tabs
Problem
Submissions

Problem: Remove Duplicates from Sorted List

Remove Duplicates from Sorted List keeps one node for each value in an ascending linked list. Return the updated list with every repeated value removed, including values that may be negative.

Statement

Given the head of a sorted linked list, remove all duplicates such that each element appears only once, and return the list in sorted order.

Constraints:

  • 0≤0 \leq n ≤300\leq 300, where n is the number of nodes in the list.

  • −100≤-100 \leq Node.val ≤100\leq 100

  • The list is guaranteed to be sorted in ascending order.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Remove Duplicates from Sorted List

Remove Duplicates from Sorted List keeps one node for each value in an ascending linked list. Return the updated list with every repeated value removed, including values that may be negative.

Statement

Given the head of a sorted linked list, remove all duplicates such that each element appears only once, and return the list in sorted order.

Constraints:

  • 0≤0 \leq n ≤300\leq 300, where n is the number of nodes in the list.

  • −100≤-100 \leq Node.val ≤100\leq 100

  • The list is guaranteed to be sorted in ascending order.