Reverse a linked list

A fundamental data structure problem that evaluates understanding of linked list operations, pointer manipulation, and algorithmic problem-solving. Typically involves changing link directions, managing head and next pointers, and handling edge cases like empty or single-node lists.