Insert a node at a specific position in a linked list

Problem Statement :

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, 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.

 head refers to the first node in the list 1->2->3 

Insert a node at position 2 with data=4. The new list is 1->2->4->3

Function Description Complete 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:
      1. head: a SinglyLinkedListNode pointer to the head of the list
      2. data: an integer value to insert as data in your new node
      3. position: an integer position to insert the new node, zero based indexing

      1. SinglyLinkedListNode pointer: a reference to the head of the revised list

Input Format:

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

     1.  1<=n<=1000
     2.  1<=Singly_LinkedListNode[i].data<1000
     3.  0<=position<=n

Solution :


                            Solution in C :

in C:

//The following function is all you need to complete the challenge in 
//hackerrank platform

SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* llist, int data, int position) {
    //iterate to the correct position in the linked list
        insertNodeAtPosition(llist->next, data, position-1);
        SinglyLinkedListNode* newnode = create_singly_linked_list_node(data);
        newnode->next = llist->next;
        llist->next = newnode;
    return llist;

In C++:

//the following function is all that is needed to complete
//the challenge in hackerrank platform

Node* InsertNth(Node *head, int data, int position)
    if(position == 0){
        Node* a = (Node*)malloc(sizeof(Node));
        a->data = data;
        a->next = head;
        return a;
        int i;
        Node* a = head;
        for(i = 1; i < position; i++)
            a = a->next;
        Node* tmp = (Node*)malloc(sizeof(Node));
        tmp->data = data;
        tmp->next = a->next;
        a->next = tmp;
        return head;

In Java:

//the following method is all that is needed to complete the 
//challenge in hackerrank platform

static SinglyLinkedListNode insertNodeAtPosition(SinglyLinkedListNode llist, int data, int position) {
     SinglyLinkedListNode node = new SinglyLinkedListNode(data);
            SinglyLinkedListNode aux = new SinglyLinkedListNode(0);
   = llist;
            for(int i=0;i<position;i++);

    return llist;


In Python 3:

# the following method is all that is need to complete
# the challenge in hackerrank platform.

def InsertNth(head, data, position):
    i = 0
    newNode = Node(data, None)
    if position is 0: = head
        head = newNode
        return head
    curr = head
    while i is not position - 1:
        curr =
        i+= 1
    prev = curr
    next = = newNode = next
    return head

View More Similar Problems

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 →

Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →