Linked Lists

Rewiring

Reverse and restructure by moving next-pointers.

• Reverse linked list (Easy)

Fast & slow pointers

Floyd's cycle detection.

• Linked list cycle (Easy)

Checkpoint

A graded check on safe rewiring and fast/slow pointer reasoning.

Pattern Quest

Practice recognizing linked lists problem shapes.

Linked lists

Practice safe pointer rewiring with sentinels, fast and slow runners, reversal, merging, and cycle reasoning without losing the unprocessed suffix.

• Add two numbers (Medium)
• Copy List with Random Pointer (Medium)
• Deep copy random pointers (Medium)
• Delete every Kth node in DLL (Medium)
• Delete node (Easy)
• Detect loop (Medium)
• Find intersection of two lists (Medium)
• Find node (Easy)
• Flatten doubly linked list (Medium)
• Insert into a Sorted Circular Linked List (Medium)
• Last men standing (Medium)
• Merge K sorted lists (Hard)
• Merge two sorted lists (Easy)
• Print from end (Easy)
• Reverse linked list (Easy)
• Reverse Nodes in k-Group (Hard)
• Sort linked list (Medium)