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. 

A 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).

A 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.

Task –

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 –

Return a reference to the head node of the linked list.

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 3, 4, and 1 at the tail of the list.

Hackerrank Day 15 : Linked List 30 days of code solution

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;
    
    if(head==NULL)
        {
        head=ll;
    }
    else
        {
        it=head;
        while(it->next)
            it=it->next;
        it->next=ll;
    }
    return head;
}

Linked List HackerRank Solution in C++

Node* insert(Node *head,int data)
      {
          //Complete this method
          if(head == nullptr){
              return new Node(data);
          }
          
          Node *temp = head;
          while(temp->next != nullptr){
              temp = temp->next;
          }
          
          temp->next = new Node(data);          
          return head;
      }

Linked List HackerRank Solution in Java

 public static  Node insert(Node head,int data){
        // if list has no elements, return a new node
        if(head == null){
            return new Node(data);
        }
        
        // else iterate through list, add node to tail, and return head
        Node tmp = head;
        while(tmp.next != null){
            tmp = tmp.next;
        }
        tmp.next = new Node(data);
            
        return head;
	}

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

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

        if (head === null || typeof head === 'undefined') {
            head = newNode;  
        } else if (head.next === null) {
            head.next = newNode;
        } else {
            var next = head.next;
            while(next.next) {
                next = next.next
            }
            next.next = newNode;
        }
        
        return head;
    };

NEXT : Hackerrank Day 16 : String to integer 30 days of code solution

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

Read More –

• How To Create Responsive Image Gallery Using Html & Css
• Create a Quiz App using HTML CSS & JavaScript
• Product Landing Page Using Html Css Bootstrap
• Home Page With Image Gallery Website Using Html Css Js Bootstrap4
• How create an Complete Responsive Ecommerce Website Using Html Css Js & Bootstrap