Reverse Nodes in k-Group · Coding Interview Practice

Reverse Nodes in k-GroupGiven the head of a linked list, reverse its nodes k at a time and return the modified list. If the number of remaining nodes is less than k, leave them as they are. Only the nodes may be rearranged, not their values.Constraints

The list has n nodes, 1 <= k <= n <= 5000

0 <= Node.val <= 1000

O(1) extra memory

Examples

Input: head = [1, 2, 3, 4, 5], k = 2 Output: [2, 1, 4, 3, 5]

Input: head = [1, 2, 3, 4, 5], k = 3 Output: [3, 2, 1, 4, 5]

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…