Remove Duplicates In Sorted Linked List

easy
1. You are given a sorted linked list with N nodes.
 2. You have to write a function that remove duplicates (nodes with 
    duplicate values) from the given list (if exists).
 3. Note: Try not to use extra space. Expected time complexity is O(N).
          The nodes are arranged in a sorted way.
 4. display is a utility function which displays the contents of Linked List,
    feel free to use it for debugging purposes.
 5. main takes input from the users and creates the Linked List. You can use
    display to know its contents.
 6. This is a functional problem. 
 7. You should code only the removeDuplicates function. It takes as input the
    head of the linked list. It should return the head of the modified
    linked list.
 8. Don't change the code of Node, main and display.

Input Format

First line takes N, the number of elements in the list. Next line takes input N space separated numbers reperesenting elements of the linked list. Input is handled for you.

Output Format

Modified Linked List. Output is handled for you.

Constraints

1 <= N <= 100

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
4
2 2 4 5
Output
2 4 5 
Previous
In Place Linked List Rearrangement
Next
Remove Duplicates In Unsorted Linked List

Related Questions