Reverse a linked list.

Reverse a linked list.

Approach: Iterate through list, reversing pointers.

function reverse(head): prev = null; curr = head; while curr: next = curr.next; curr.next = prev; prev = curr; curr = next; return prev

Follow-up: Do it recursively.

Key concepts: pointers, iteration, edge cases.