To reverse a linked list, we need to iterate through the list, and for each node, set its next pointer to the previous node.

217

Dec 13
This problem deals with reversing a linked list. The input is a list of nodes, and the output should be the list of nodes in reverse order.

248

Dec 13
This technical problem involves removing duplicate elements from a singly linked list. An example input is given, as well as the expected output.

217

Dec 09
This technical problem deals with singly linked lists, and specifically with checking if a given singly linked list is a palindrome. A palindrome is defined as a word, phrase , or sequence that reads the same backward as forward, and so in this context, a palindrome linked list would be one where the order of the nodes is the same whether you traverse the list from the beginning or from the end. The input to the function is a singly linked list, and the output is a boolean value indicating whether or not the list is a palindrome.

218

Dec 08
This problem asks you to reverse a singly linked list. An example input is given as 1->2->3->4->5, and the expected output is 5->4->3 ->2->1.

230

Dec 07
This problem deals with reversing a linked list. An example input is given as 1 -> 2 -> 3 -> 4, and the corresponding output would be 4 -> 3 -> 2 -> 1.

202

Dec 07
Write a function that takes a linked list as input and returns the second to last node in the list.

218

Dec 06
Given a singly linked list, this function returns the middle node of the list. If the list has an even number of nodes, the function returns the node at the start of the second half of the list.

250

Dec 05