Construct a linked list by merging alternate nodes of two given lists

Given two linked lists, merge their nodes together to make one list, taking nodes alternately between the two lists. If either list runs out, all the nodes should be taken from the other list.

Split linked list into two lists where each list containing alternating elements from it

Given a linked list, split its into two lists where each list containing alternating elements from the original list. The elements in the new lists may be in any order.

Move even nodes to the end of the list in reverse order

Rearrange the given linked list such that every even node will be moved to end of the list in reverse order.

Move front node of the given list to the front of the another list

Given a linked list, move front node of it to the front of the another given list.

Remove duplicates from a sorted linked list

Given a linked list sorted in increasing order, write a function which removes any duplicate nodes from the list by traversing the list only once.

Split nodes of the given linked list into front and back halves

Given a list, split it into two sublists – one for the front half, and one for the back half. If the number of elements is odd, the extra element should go in the front list.

Given a linked list, write a function to rearrange its nodes so they are sorted in increasing order. In other words, sort linked list.

Insert given node into the correct sorted position in the given sorted linked list

Given a list that is sorted in increasing order, and a single node, insert the node into the correct sorted position in the given list. The function should take an existing node, and just rearranges pointers to insert it into the list.

Pop operation in linked list in C and Java

Write a Pop() function that is the inverse of Push(). Pop() takes a non-empty list, deletes the head node, and returns the head node’s data.

Delete a Linked List in C

Write a function that takes a linked list, deallocates all of its memory and sets its head pointer to NULL (the empty list).

Clone a Linked List in C and Java

Write a function that takes a singly linked list and returns a complete copy of that list.