Build a Linked List

pointer reversal and Floyd's cycle check

Challenge 1 of Linear Structures & BitsBeginner~55 minFree

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.

5 steps

1. 1Nodes and Conversions
2. 2Reverse the List
3. 3Detect a Cycle
4. 4Find the Middle
5. 5Merge Two Sorted Lists