Reverse a Linked List | Dataford Interview Questions

Reverse a linked list

Asked in the Technical Interview 1 stage. Easy DSA.

Implement reverse_linked_list(head) for a singly linked list. Each node has val and next fields. Return the new head after reversing the links in place. Test cases represent linked lists as arrays of node values, with the expected result also represented as an array.

Constraints

0 <= number of nodes <= 10^5
Each node contains a value and a next pointer
The list is singly linked

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

Reverse a linked list

Asked in the Technical Interview 1 stage. Easy DSA.

Constraints

0 <= number of nodes <= 10^5
Each node contains a value and a next pointer
The list is singly linked

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.