Linked List Algorithms

Delete the first occurrence of a specific value.

Move the head pointer to remove the first node.

Insert a new node at the beginning of a Singly Linked List.

Traverse to a position and reconnect pointers around a new node.

Insert a new node at the end of a Singly Linked List.

Find a specific value in a Singly Linked List.

Traverse a singly linked list from head to tail visiting each node.

Traverse to second-to-last node and unlink the tail.

Use slow and fast pointers to find whether a cycle exists.

Find the middle node using slow and fast pointers in one pass.

Remove duplicate consecutive values from a sorted linked list.

Reverse each next pointer until the list direction flips.