Reverse a Linked List

Write a function reverseLinkedList that takes a head node of a singly linked list, reverses it in place, and returns the new head node.

You will be given the head as the input, and you should return the new head for the reverse linked list which is the current tail node. All the items should be in reverse order, starting with the tail (new head). The reverse should happen in place which means you should not create a new linked list.

Breakdown

Follow teacher

Table of Contents

Validate My Answer

You only need to iterate through the list once which means it will be O(n) time.
You will need three pointers to store nodes and no additional data structures. This will be O(1) space.
The solution doesn't use a lot of code, but it does require writing the procedure carefully and in the correct order. Make sure you handle this and think through edge cases.

Follow teacher

Table of Contents

Test Results

Run your code and see results here...

/**
 * @param {Node} head
 * @return {Node}
 */
const reverseLinkedList = (head) => {
  // Your solution here
};

Reverse a Linked List

Write a function reverseLinkedList that takes a head node of a singly linked list, reverses it in place, and returns the new head node.

/**
 * @param {Node} head
 * @return {Node}
 */
const reverseLinkedList = (head) => {
  // Your solution here
};