Reverse a Linked List Problem Statement

Given a singly linked list of integers, your 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 and the head of the reversed linked list will be 4.

Explanation:

The linked list has been reversed.

Constraints:

1

Question

Given a singly linked list of integers, your task is to return the head of the reversed linked list.

The given linked list is 1 -> 2 -> 3 -> 4-> NULL.

The reversed linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

The linked list has been reversed.

You do not need to print anything, it has already been taken care of. Just implement the given function.

Accepted Answer

Reverse a singly linked list of integers 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.
Keep track of the previous, current, and next nodes while reversing the linked list.
Update the head of the reversed linked list to be the last node encountered.
Ensure to handle edge cases like an empty linked list or a linked list with only one node.

Microsoft Corporation Software Developer Intern interview questions & answers