Insert a node at a specific position in a linked list HackerRank Solution

Insert a node at a specific position in a linked list HackerRank Solution
Source : https://www.hackerrank.com/challenges/insert-a-node-at-a-specific-position-in-a-linked-list

_{This challenge is part of a tutorial track by MyCodeSchool and is accompanied by a video lesson.}

You’re given the pointer to the head node of a linked list, an integer to add to the list and the position at which the integer must be inserted. Create a new node with the given integer, insert this node at the desired position and return the head node.

A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is empty.

As an example, if your list starts as and you want to insert a node at position with , your new list should be

Function DescriptionComplete the function insertNodeAtPosition in the editor below. It must return a reference to the head node of your finished list.

insertNodeAtPosition has the following parameters:

• head: a SinglyLinkedListNode pointer to the head of the list
• data: an integer value to insert as data in your new node
• position: an integer position to insert the new node, zero based indexing

Input Format

The first line contains an integer , the number of elements in the linked list.
Each of the next lines contains an integer SinglyLinkedListNode[i].data.
The next line contains an integer denoting the data of the node that is to be inserted.
The last line contains an integer .

Constraints

• , where is the element of the linked list.
• .

Output Format

Return a reference to the list head. Locked code prints the list for you.

Sample Input

31613712

Sample Output

16 13 1 7

Explanation

The initial linked list is 16 13 7. We have to insert at the position which currently has in it. The updated linked list will be 16 13 1 7

Source : https://www.hackerrank.com/challenges/insert-a-node-at-a-specific-position-in-a-linked-list

Solution

	// Karthikalapati.blogspot.com
	/*
	Insert Node at a given position in a linked list
	First element in the linked list is at position 0
	Node is defined as
	class Node {
	int data;
	Node next;
	}
	*/
	Node InsertNth(Node head, int data, int position) {
	Node newNode = new Node();
	newNode.data = data;
	if (position == 0) {
	newNode.next = head;
	return newNode;
	} else {
	/* Get Node one element before desired position */
	Node n = head;
	for (int i = 0; i < position - 1; i++) {
	n = n.next;
	}
	/* Insert our new Node */
	newNode.next = n.next;
	n.next = newNode;
	return head;
	}
	}