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

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →

Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →

Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

View Solution →

Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

View Solution →


This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →

Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →