Reverse a Linked List | Dataford Interview Questions

Write a program to reverse a linked list, both iteratively and recursively.

Implement both approaches for a singly linked list. Each function receives the head of a ListNode chain and returns the new head. For evaluation, linked lists are represented as arrays of node values, with [] representing an empty list.

Required functions

reverse_linked_list(head) using iteration.
reverse_linked_list_recursive(head) using recursion.

Constraints

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

Function Signature

def reverse_linked_list(head):

Your question is Reverse 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