Insert a Node at the head of a Linked List


Problem Statement :


Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty.

Function Description:

Complete the function insertNodeAtHead in the editor below.

insertNodeAtHead has the following parameter(s):
      1. SinglyLinkedListNode llist: a reference to the head of a list
      2. data: the value to insert in the data field of the new node


Input Format:

The first line contains an integer n, the number of elements to be inserted at the head of the list.
The next n lines contain an integer each, the elements to be inserted, one per function call.


Constraints:
      1.   1<=n<=1000
      2.   1<=list[i]<=1000


Solution :



title-img 


                            Solution in C :

In C:

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

SinglyLinkedListNode* insertNodeAtHead(SinglyLinkedListNode* llist, int data) {
    
    SinglyLinkedListNode* new = malloc(sizeof(SinglyLinkedListNode));
    new->data = data;
    
    if(llist == NULL){
        llist = new;
        new->next = NULL;
        return llist; 
    }
    
    new-> next = llist;
    llist = new;
    return llist;

}







In C++:

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

Node* Insert(Node *head,int data)
{
  Node *n = new Node();
  n->data = data;
  n->next=head;
  return head = n;  
}








In Java:

//the following method is all you need to complete the challenge in
//hackerrank platform.

 static SinglyLinkedListNode insertNodeAtHead(SinglyLinkedListNode head, int data) {
        SinglyLinkedListNode node = new SinglyLinkedListNode(data);
        if (head == null) {
            return node;
        } else {
            node.next = head;
            head = node;
            return head;
        }
    }








In Python 3:

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

def Insert(head, data):
    newNode = Node(data, head)
    
    return newNode








View More Similar Problems

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →

Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →

Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →

Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →