Linked Lists Checkpoint

1. When reversing a linked list, which pointer becomes the new head?

The previous pointer (prev) The current pointer The next pointer The original head

2. Floyd's cycle detection uses:

Fast and slow pointers Hash set Stack Recursion

3. The dummy head technique helps avoid:

4. LRU Cache combines which two data structures?

Hash map and doubly linked list Array and stack Tree and queue Heap and set

5. Space complexity of merging two sorted lists in-place?