Reverse a Linked List Iteratively
You are given a singly linked list of integers. The 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. The head of the reversed linked list will be 4.
Constraints:
1 <= T <= 5
0 <= L <= 10^5
- Values in the list are in the range
1 ≤ data ≤ 10^9
and not equal to -1.
Follow Up:
Can you solve this problem in O(N) time and O(1) space complexity?
Input:
The first line of input contains an integer 'T' representing the number of test cases or queries to be processed. Then the test case follows.
The only 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:
For each test case, print the given linked list in reverse order in a separate line.
Note:
You do not need to print anything; it has already been taken care of. Just implement the given function.
AnswerBot
2d
Reverse a singly linked list iteratively and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node...read more
Help your peers!
Add answer anonymously...
Top SAP Developer Associate interview questions & answers
Popular interview questions of Developer Associate
Top HR questions asked in SAP Developer Associate
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app