6 docs tagged with "Slow and Fast Pointers"

Given head, the head of a linked list, determine if the linked list has a cycle in it.

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.

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

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

You are given the head of a singly linked-list...

Given the head of a linked list, return the list after sorting it in ascending order.