This problem asks you to reverse the order of a singly linked list. For example, if the input list is 1->2->3->4->5, the output should be 5 ->4->3->2->1.

200
Nov 18
##### Find a node with a given value in a singly linked list

This problem asks you to write a function that takes in the head node of a singly linked list and a value, and returns the node with the given value. If the value is not present in the linked list, return null.

205
Nov 18
##### Reversing a singly linked list.

This problem asks you to reverse the order of the nodes in a singly linked list. For example, if the input list is 1->2->3->4->5, the output should be 5->4->3->2->1.

123
Nov 11
##### Remove Duplicates from Linked List

This technical problem deals with removing duplicate elements from a linked list. Given an input list with duplicates, the goal is to produce an output list with all duplicates removed. An example input and output is provided.

160
Nov 06

This problem asks you to reverse a linked list. For example, if the input list is 1->2->3->4->5, the output should be 5->4->3-> 2->1.

153
Nov 03
##### Determining if a Singly Linked List is a Palindrome

This problem asks whether a singly linked list is a palindrome, meaning that the list is the same when read forwards and backwards. For example, the list 1->2->2 ->1 would be considered a palindrome, while 1->2->3 would not be.

178
Nov 02
##### Reversing a Singly Linked List

This technical problem involves reversing the order of nodes in a singly linked list. An example input and output are provided.

186
Nov 02
##### Determining Palindromicity in a Singly Linked List

Given a singly linked list, this algorithm determines whether or not the list is palindromic.

176
Nov 01