3 docs tagged with "Linked List"

Given the head of a singly linked list, find and return the middle node.

Given the head of a linked list, remove the nth node from the end of the list and return its head.

Given the head of a singly linked list, reverse the list and return the head of the reversed list.