Linked Lists

Build a singly linked list from the ground up. You will implement the node structure and conversion helpers, then reverse a list, detect cycles with Floyd's fast and slow pointers, find the middle node, and merge two sorted lists. These are the exact operations behind many queues and LRU chains, and they are classic interview staples.