System Engineer

The idea is to use three pointers curr, prev, and next to keep track of nodes to update reverse links.
1. Initialize Pointers:
Declare three pointers: previous, current, and next.
prev: Points to the previous node initially set to NULL (since it will be the end of the reversed list).
current: Points to the current node starting from the head of the original list.
next: Used to temporarily store the next node in the original list before we change the current node's next pointer.

2. Iterate Through the List:
Traverse through the linked list using the current pointer.
In each iteration:
Store the next node (next = current->next) because we are going to change current->next.
Reverse the link: current->next = prev. This step changes the direction of the pointer.
Move prev and current pointers one step forward: prev = current and current = next.

3. Completion of Reversal:
After the loop finishes, prev will be pointing to the new head of the reversed list (which was the last node of the 
original list).