Reverse a Linked List Problem Statement

You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.

Input:

The first line of input contains a single integer T, representing the number of test cases to be run.

For each test case, the first line contains the elements of the singly linked list separated by a single space and terminated by -1. Hence, -1 would never be a list element.

Output:

For each test case, print the reversed linked list. The elements of the reversed list should be single-space separated and terminated by -1.

Print the output of each test case on a separate line.

Example:

Input:

2
1 2 3 4 5 -1
10 20 30 40 -1

Output:

5 4 3 2 1 -1
40 30 20 10 -1

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10^4
• 0 <= data <= 10^9
• N is the number of nodes in the linked list.
• Time Limit: 1 sec

Note:

You do not need to print anything; just return the head of the reversed linked list.