Implement Data Structure Ops | Dataford Interview Questions

Implement a solution for a common data structure manipulation (e.g., linked lists, trees, or graphs). For this task, reverse a singly linked list in place and return its new head. Use reverse_list(head), where head is a ListNode with value and next fields; the test harness represents lists as arrays and serializes the returned list as an array. Preserve all nodes and use constant auxiliary space.

Constraints

0 <= number of nodes <= 1000
Each node value is an integer
The list contains no cycles
Return the existing nodes in reversed order

Function Signature

def reverse_list(head):

Your question is Implement Data Structure Ops. 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

Constraints

0 <= number of nodes <= 1000
Each node value is an integer
The list contains no cycles
Return the existing nodes in reversed order

Function Signature

def reverse_list(head):

Your question is Implement Data Structure Ops. 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.