How can you reverse a linked list?

How can you reverse a linked list?

Reversing a linked list involves changing the direction of pointers, which can be achieved by maintaining three pointers (prev, current, next) and updating them in a loop until all nodes are reversed. This operation has a time complexity of $O(n)$, where $n$ is the number of nodes in the linked list.