Given a linked list of N nodes. The task is to reverse this list.
Input: Head of following linked list
1->2->3->4->NULL
Output: Linked list should be changed to,
4->3->2->1->NULLInput: Head of following linked list
1->2->3->4->5->NULL
Output: Linked list should be changed to,
5->4->3->2->1->NULLInput: NULL
Output: NULLInput: 1->NULL
Output: 1->NULL
Input:
First line of input contains number of testcases T. For each testcase, first line contains length of linked list and next line contains the elements of linked list.
Output:
Reverse the linked list and return head of the modified list.
User Task:
The task is to complete the function reverseList() which head reference as the only argument and should return new head after reversing the list.
Constraints:
1 <= T <= 100
1 <= N <= 103
Example:
Input:
2
6
1 2 3 4 5 6
5
2 7 8 9 10
Output:
6 5 4 3 2 1
10 9 8 7 2
Explanation:
Testcase 1: After reversing the list, elements are as 6->5->4->3->2->1.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| bruceewayne | 160 |
| manvirag982 | 134 |
| Core_Ka_Bachha | 133 |
| rajupraaa1234 | 131 |
| vinu_ramanan | 123 |
| mr_kksparrow | 433 |
| manvirag982 | 350 |
| rajupraaa1234 | 266 |
| Exception_404 | 250 |
| PranathiBhuvanagiri | 242 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |