Linked Lists

Implement a singly linked list with insertion, deletion, and traversal operations.

Implement a doubly linked list with insertion, deletion, and traversal operations.

Reverse a linked list both iteratively and recursively.

Detect and find the starting node of a cycle in a linked list using Floyd's algorithm.

Find the middle element of a linked list using the slow and fast pointer technique.

Find the intersection point of two linked lists.

Merge two sorted linked lists iteratively.

Apply the dummy node technique to simplify linked list manipulation problems (e.g., removing nodes).