Given the head of a singly linked list, reverse the list, and return the reversed list.

Reversing a linked list involves changing the direction of the pointers between nodes.

• Iterative approach: Use three pointers (prev, current, next) to reverse links.

• Example: For list 1 -> 2 -> 3, after...read more