Reversing a linked list is the classic test of whether you can change next references without losing the rest of the list. It needs three pointers and one pass, with no extra memory. Use it on its own and as a step inside harder problems like checking a palindrome list or reversing in groups. Copying values into an array and back also works, but it uses O(n) space and interviewers usually want the in-place version.