**Delete duplicate-value nodes from a sorted linked list**

### Problem Statement :

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -> 2- > 3 -> 3 -> 3 -> 3 -> NULL. Remove 1 of the 2 data values and return pointing to the revised list 1 -> 2 -> 3 -> NULL. Function Description Complete the removeDuplicates function in the editor below. removeDuplicates has the following parameter: SinglyLinkedListNode pointer head: a reference to the head of the list Returns SinglyLinkedListNode pointer: a reference to the head of the revised list Input Format The first line contains an integer t, the number of test cases. The format for each test case is as follows: The first line contains an integer n, the number of elements in the linked list. Each of the next n lines contains an integer, the data value for each of the elements of the linked list.

### Solution :

` ````
Solution in C :
In C++ :
/*
Remove all duplicate elements from a sorted linked list
Node is defined as
struct Node
{
int data;
struct Node *next;
}
*/
Node* RemoveDuplicates(Node *head)
{
// This is a "method-only" submission.
// You only need to complete this method.
Node *ptr = head,*temp=NULL,*tmp=NULL;
while(ptr!=NULL && ptr->next!=NULL)
{
temp = ptr->next;
ptr->next=NULL;
while(temp!=NULL && ptr->data == temp->data)
{
tmp=temp;
temp=temp->next;
tmp->next=NULL;
delete(tmp);
}
ptr->next = temp;
ptr = temp;
}
return head;
}
In Java :
Node RemoveDuplicates(Node head) {
// This is a "method-only" submission.
// You only need to complete this method.
if(head==null)
return null;
Node temp=head.next;
Node prev=head;
while(temp!=null)
{
if(prev.data==temp.data)
{
prev.next=temp.next;
temp.next=null;
temp=prev.next;
}
else
{
prev=temp;
temp=temp.next;
}
}
return head;
}
In python3 :
"""
Delete duplicate nodes
head could be None as well for empty list
Node is defined as
class Node(object):
def __init__(self, data=None, next_node=None):
self.data = data
self.next = next_node
return back the head of the linked list in the below method.
"""
def RemoveDuplicates(head):
c = head
p = None
if c==None or c.next==None:
return(head)
else:
p=c
c=c.next
while c!= None:
if p.data==c.data:
p.next = c.next
c=c.next
else:
p = p.next
c = c.next
return(head)
In C :
// Complete the removeDuplicates function below.
/*
* For your reference:
*
* SinglyLinkedListNode {
* int data;
* SinglyLinkedListNode* next;
* };
*
*/
SinglyLinkedListNode* removeDuplicates(SinglyLinkedListNode* head) {
struct SinglyLinkedListNode*temp1=head;
struct SinglyLinkedListNode*temp=head->next;
while(temp!=NULL)
{
if(head->data==temp->data)
{
temp=temp->next;
head->next=temp;
}
else
{
head=temp;
temp=temp->next;
}
}
return temp1;
}
```

## View More Similar Problems

## No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →## Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →## Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →## Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →