Reverse the list 3 nodes at a time. For each group: check that 3 nodes remain, reverse them with the usual prev and curr walk so that the group's last arrow points at the following group, and hook the previous group's tail onto the new front. A short group at the end is left as it is.
Reversing 1, 2, 3, 4, 5, 6, 7, 8 in groups of 3.
From 1, count 3 ahead: 1, 2, 3 is a full group, ending before 4. Reverse it.
Group 1, 2, 3.
Flip 1's arrow to point at 4, the node after the group, so the group's tail is wired up before anything else moves. prev = 1, curr = 2.
1 now points at 4.
Flip 2's arrow to point at 1. prev = 2, curr = 3.
2 now points at 1.
Flip 3's arrow to point at 2. prev = 3, curr = 4.
3 now points at 2.
The head now points at 3, the group's new front. 1 became the group's tail. The list reads 3, 2, 1, 4, 5, 6, 7, 8.
List reads 3, 2, 1, 4, 5, 6, 7, 8.
From 4, count 3 ahead: 4, 5, 6 is a full group, ending before 7. Reverse it.
Group 4, 5, 6.
Flip 4's arrow to point at 7, the node after the group, so the group's tail is wired up before anything else moves. prev = 4, curr = 5.
4 now points at 7.
Flip 5's arrow to point at 4. prev = 5, curr = 6.
5 now points at 4.
Flip 6's arrow to point at 5. prev = 6, curr = 7.
6 now points at 5.
1, the previous group's tail, now points at 6, this group's new front. 4 became the group's tail. The list reads 3, 2, 1, 6, 5, 4, 7, 8.
List reads 3, 2, 1, 6, 5, 4, 7, 8.
From 7, count 3 ahead: only 2 nodes remain, so this tail stays in order and 4 keeps pointing at it.
Short group of 2, left alone.
2 groups of 3 reversed, the list reads 3, 2, 1, 6, 5, 4, 7, 8. Every node's arrow was rewritten at most once plus one hook-up per group, O(n) time and O(1) extra space. Only the arrows moved.
Result 3, 2, 1, 6, 5, 4, 7, 8.