Reverse a Linked List Problem Statement

Given a singly linked list of integers, your task is to return the head of the reversed linked list.

Example:

Input:

The given linked list is 1 -> 2 -> 3 -> 4-> NULL.

Output:

The reversed linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

Explanation:

The linked list has been reversed.

Constraints:

• 1 <= T <= 5
• 0 <= L <= 105
• 1 <= data <= 109 and data != -1
• Time Limit: 1 sec

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.