Reverse Linked List Approach | Dataford Interview Questions

How do you reverse a singly linked list in-place using only pointers?

Implement reverse_list(head) and return the new head after reversing the list. The evaluator constructs the linked list from an input array and serializes the returned list back to an array. Do not create replacement nodes or use arrays, stacks, or other collections.

Constraints

0 <= number of nodes <= 1000
Node values are integers
Each node has exactly one next pointer
The list may be empty
Reuse the existing nodes and use O(1) auxiliary space

Function Signature

def reverse_list(head):

Your question is Reverse Linked List Approach. 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

How do you reverse a singly linked list in-place using only pointers?

Constraints

0 <= number of nodes <= 1000
Node values are integers
Each node has exactly one next pointer
The list may be empty
Reuse the existing nodes and use O(1) auxiliary space

Function Signature

def reverse_list(head):

Your question is Reverse Linked List Approach. 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.