Reverse Linked List In-Place

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Reverse Linked List In-Place. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Given the head of a singly linked list, reverse the list in place and return the new head. Do not create a second list or use extra nodes.

Formal Specification

Input: head, the head node of a singly linked list. Each node has fields val and next.
Output: The head node of the reversed linked list.
The list may be empty or contain one node.

def reverse_linked_list(head):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output