Given a singly linked list consisting of N nodes. The task is to remove duplicates (nodes with duplicate values) from the given list (if exists).
Note: Try not to use extra space. Expected time complexity is O(N). The nodes are arranged in a sorted way.
First line of input contains number of testcases T. For each testcase, first line of input contains length of linked list and next line contains the linked list data.
For each testcase, there will be a single line of output which contains linked list with no duplicates.
The task is to complete the function removeDuplicates() which should remove the duplicates from linked list. The printing is done automatically by the driver code.
1 <= T <= 100
1 <= N <= 100
2 2 4 5
2 2 2 2 2
2 4 5
Testcase 1: In the given linked list 2 ->2 -> 4-> 5, only 2 occurs more than 1 time.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.