Linked Lists

Implement a singly linked list in Java supporting insertion, deletion, and traversal.

Implement a doubly linked list and its associated operations.

Reverse a singly linked list both iteratively and recursively.

Apply the slow-fast pointer technique to find the middle of a linked list.

Detect a cycle in a linked list and find its starting point using Floyd's cycle-finding algorithm.

Merge two sorted linked lists into a single sorted list.

Determine if a linked list is a palindrome, progressing from O(n) space to an O(1) space solution.

Reverse the nodes of a linked list in groups of size K.