Reverse nodes in k-group

Count the nodes, then for every full group of k: find its last node, cut it off, reverse it with firstNode, secondNode and thirdNode, and link the previous group's last node to it. The last group is linked to the leftover nodes once the loop ends.

On the linked list nodes stay put while their links turn, then slide into order.