Solving Remove Duplicates from Sorted List II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

Example 1:

Input: 1->2->3->3->4->4->5
Output: 1->2->5

Example 2:

Input: 1->1->1->2->3
Output: 2->3

See the full details of the problem Remove Duplicates from Sorted List II at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go