Reverse Linked List In-Place

EasyPython

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):

CodePython 3

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

Run your code to see test output here.