Reverse Nodes in K Group

Problem

Reverse linked-list nodes in groups of size k; leave a final short group unchanged.

Examples

Example 1

Input: {"values":[1,2,3,4,5],"k":2}

Output: [2,1,4,3,5]

Example 2

Input: {"values":[1,2,3,4,5],"k":3}

Output: [3,2,1,4,5]

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Reverse Nodes in K Group

Reverse linked-list nodes in groups of size k; leave a final short group unchanged. Reverse complete groups only; detect whether k nodes remain. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n) time and O(1) additional space for in-place pointer reversal.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.