Insert a node at the head of a linked list hackerrank Solution

Insert a node at the head of a linked list

We have to insert a node at the head of a Linked List. For Example:

Input

As we have to insert a node at the head of a Linked List. So it will be

383->NULL

484->383->NULL

392->484->383->NULL

975->392->484->383->NULL

321->975->392->484->383->NULL

Output

Here, I have represented the logic of the Inserting Node at the head of Linked List in C++. Please Dry and Run the code for the better Understanding.

Insert node at tail : HackerRank Solution in C++

Cycle Detection: HackerRank Solution in C++

Hacker Rank Solutions: Find Merge Point of Two Lists

Hacker Rank Solution: Print the Elements of a Linked List

Hacker Rank Solution: Merge two sorted linked lists

Sparse Arrays : HackerRank Solution in C++

Left Rotation : HackerRank Solution in C++

Array Manipulation: HackerRank Solution in C++

Forming a Magic Square : HackeRank Solution in C++