Reversing a Linked List | Dataford Interview Questions

Write an algorithm for reversing a Linked List.

Implement def reverse_linked_list(head): using singly linked-list nodes. The function must return the new head after reversing the list in place.

For grading, linked lists are represented as arrays of node values in examples and test cases, where [] represents a null head. Return the reversed list through its node sequence. Use constant auxiliary space.

Constraints

0 <= number of nodes <= 100000
Node values are integers
The list is singly linked and contains no cycles
Reverse the list in place using O(1) auxiliary space

Function Signature

def reverse_linked_list(head):

Your question is Reversing a Linked List. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write an algorithm for reversing a Linked List.

Implement def reverse_linked_list(head): using singly linked-list nodes. The function must return the new head after reversing the list in place.

Constraints

0 <= number of nodes <= 100000
Node values are integers
The list is singly linked and contains no cycles
Reverse the list in place using O(1) auxiliary space

Function Signature

def reverse_linked_list(head):

Your question is Reversing a Linked List. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.