1. Write an algorithm to detect a cycle in a linked list.
2. Remove consecutive duplicate entries from a given linked list.
3. Get the k-th to the last element in the linked list (when the size of the list is not known/tracked).
4. Check if the linked list is a palindrome.
5. Reverse a singly-linked list non-recursively.