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.
Input:
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.
Output:
For each testcase, there will be a single line of output which contains linked list with no duplicates.
User Task:
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.
Constraints:
1 <= T <= 100
1 <= N <= 104
Example:
Input:
2
4
2 2 4 5
5
2 2 2 2 2
Output:
2 4 5
2
Explanation:
Testcase 1: In the given linked list 2 ->2 -> 4-> 5, only 2 occurs more than 1 time.
Testcase 2: In the given linked list 2 ->2 ->2 ->2 ->2, 2 is the only element and is repeated 5 times.
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.
| praneethmamidala83 | 583 |
| pallavimanukonda8 | 563 |
| a8haysingh | 451 |
| vraamg | 432 |
| RajatGarg5 | 386 |
| descifrador | 1683 |
| mantu_singh | 1520 |
| rishabh2017 | 1273 |
| gladiator121 | 1268 |
| kid_kb | 1264 |
| blackshadows | 5362 |
| Ibrahim Nash | 5244 |
| akhayrutdinov | 5111 |
| mb1973 | 4974 |
| Quandray | 4732 |