Reverse a Linked List or Memory Allocator | Dataford Interview Questions

Implement a function to reverse a linked list, or simulate a memory allocator.

Asked in the C programming round stage. Choose one of the two tasks; this specification defines the linked-list option.

Formal Specification

Implement reverse_linked_list(head), where head references the first node of a singly linked list. Each node has value and next fields. Return the new head after reversing all links. For examples and JSON tests, a list of values represents the linked list, and the expected output is the reversed list of values.

Constraints

0 <= number of nodes <= 10^5
Node values are integers
The list is singly linked
Reverse links in place without creating replacement nodes

Function Signature

def reverse_linked_list(head):

Your question is Reverse a Linked List or Memory Allocator. 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