5

Reverse Linked List

Difficulty: EASY
Contributed By
Sakshi Bansal
Avg. time to solve
15 min
Success Rate
85%

Problem Statement
Suggest Edit
Input Format :
The first line of input contains a single integer T, representing the number of test cases or queries to be run. 

The first line of each test case 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 Format :
For each test case, print the reversed linked list. The elements of the reversed list should be single-space separated, terminated by -1.

Print the output of each test case in a separate line. 
Note :
You do not need to print anything, just return the head of the reversed linked list. 
Constraints :
1 <= T <= 10
1 <= N <= 10^4
0 <= data <= 10^9

Where 'N' is the number of nodes in the linked list.

Time Limit: 1 sec
Sample Input 1 :
3
1 -2 3 -1
9 9 -1
4 -1
Sample Output 1 :
3 -2 1 -1
9 9 -1
4 -1
Explanation for Sample Input 1 :
For every test case, the reversed list is printed, terminated by -1.
Sample Input 2 :
2
1 1 1 -1
3 -3 -1
Sample Output 2 :
1 1 1 -1
-3 3 -1
Reset Code
Full screen
copy-code
Console