Reverse A Linkedlist

easy
Question Solve Solutions 
You have given a pointer to the head node of a linked list, the task is to reverse the linked list. 
We need to reverse the list by changing the links between nodes.

Input Format

1->2->3->4->5->6->7->null

Output Format

7->6->5->4->3->2->1->null

Constraints

0 <= N <= 10^6

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
7
1 2 3 4 5 6 7
Output
7 6 5 4 3 2 1
Next
Middle Of A Linked List

Related Questions

easy Middle Of A Linked List easy Palindrome Linkedlist easy Fold Of Linkedlist easy Unfold Of Linkedlist easy Merge Two Sorted Linkedlist easy Mergesort Linkedlist easy Segregate Even And Odd Nodes In A Linkedlist easy Remove Nth Node From End Of Linkedlist easy Merge K Sorted Linkedlist easy Reverse Node Of Linkedlist In K Group easy Reverse In Range easy Copy Linkedlist With Random Pointers easy Is Cycle Present In Linkedlist easy Add Two Linkedlist medium Subtract Two Linkedlist easy Multiply Two Linkedlist