Reverse a Singly Linked List

EasyPython00:00

Practice interviewer

In session

5 left

00:00

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

Problem

Given the head of a singly linked list, reverse the list and return the new head. Each node contains an integer value and a next pointer. The function should modify the links in-place rather than creating a second list.

Constraints

0 <= number of nodes <= 5000
-5000 <= Node.val <= 5000
The input list is singly linked and may be empty

Function Signature

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