Home30 Days Of CodeHackerrank Day 15 : Linked List 30 days of code solution

# Hackerrank Day 15 : Linked List 30 days of code solution

Today we are going to solve Hackerrank Day 15 : Linked List 30 days of code solution in C, C++ , Java , Python & Javascript.

Objective

Today we will work with a Linked List

Node class is provided for you in the editor. A Node object has an integer data field, data, and a Node instance pointer, next, pointing to another node (i.e.: the next node in the list).

Node insert function is also declared in your editor. It has two parameters: a pointer, head, pointing to the first node of a linked list, and an integer, data, that must be added to the end of the list as a new Node object.

Complete the insert function in your editor so that it creates a new Node (pass data as the Node constructor argument) and inserts it at the tail of the linked list referenced by the head parameter. Once the new node is added, return the reference to the head node.

Note: The head argument is null for an empty list.

Input Format

The first line contains T, the number of elements to insert.
Each of the next T lines contains an integer to insert at the end of the list.

Output Format

Sample Input

``````STDIN   Function
-----   --------
4       T = 4
2       first data = 2
3
4
1       fourth data = 1``````

Sample Output

``2 3 4 1``

Explanation

T = 4, so your method will insert 4 nodes into an initially empty list.
First the code returns a new node that contains the data value 2 as the head of the list. Then create and insert nodes 34, and 1 at the tail of the list.

## Linked List HackerRank Solution in C

```Node* insert(Node *head,int data)
{
//Complete this function
struct Node *ll, *it;
ll=(struct Node *)malloc(sizeof(struct Node));
ll->data=data;
ll->next=NULL;

{
}
else
{
while(it->next)
it=it->next;
it->next=ll;
}
}```

## Linked List HackerRank Solution in C++

```Node* insert(Node *head,int data)
{
//Complete this method
return new Node(data);
}

while(temp->next != nullptr){
temp = temp->next;
}

temp->next = new Node(data);
}```

## Linked List HackerRank Solution in Java

``` public static  Node insert(Node head,int data){
// if list has no elements, return a new node
return new Node(data);
}

// else iterate through list, add node to tail, and return head
while(tmp.next != null){
tmp = tmp.next;
}
tmp.next = new Node(data);

}```

## Linked List HackerRank Solution in Python 3

```def insert(self,head,data):
temp = Node(data)
while current.next is not None:
current = current.next
current.next = temp

## Linked List HackerRank Solution in Javascript

```this.insert=function(head,data){
//complete this method
var newNode = new Node(data);

} else if (head.next === null) {
} else {
while(next.next) {
next = next.next
}
next.next = newNode;
}

};```

30 Days of Code HackerRank Solutions List – Day 0 to Day 29

RELATED ARTICLES