Insert a Node at the Tail of a Linked List HackerRank Solution. You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.
Tag: hackerrank linkedlist
Delete duplicate-value nodes from a sorted linked list Java (HackerRank)
Delete duplicate-value nodes from a sorted linked list Java. You're given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete as few nodes as possible so that the list does not contain any value more than once. The given head pointer may be null indicating that the list is empty.
THE NUCLEAR GEEKS 