Reverse Nodes in K Groups

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Reverse Nodes in K Groups. 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 and an integer k, reverse the nodes of the list k at a time and return the modified head. If the number of remaining nodes is less than k, leave that final portion unchanged. The node values must stay attached to their original nodes; only links may be changed.

Constraints

1 <= number of nodes <= 5000
0 <= Node.val <= 1000
1 <= k <= number of nodes
Use O(1) extra space beyond a few pointers

Function Signature

def reverse_k_group(head, k):

Your solutionPython 3

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

Run your code to see test output