LC 25 Reverse Nodes in k-Group (Linked List) | O(1)Reverse linked list in k groups (Hard): in-place pointer reversal with dummy node. Optimal O(n) time, O(1) space—step-by-step solution.