Reverse Nodes in K Groups | Dataford Interview Questions

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 question is Reverse Nodes in K Groups. 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

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 question is Reverse Nodes in K Groups. 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.