In Part 1 we saw how a sliding window collapses a nested loop into a single pass over an array. In Part 2 we used two pointers moving toward each other — or side by side — to restructure and search sorted arrays in O(n) time and O(1) space.

Today's pattern shares that same O(1) space philosophy, but it lives in a different world: linked lists....