Leetcode 25. Reverse Nodes in k-Group
Given the head of a linked list and an integer k, reverse the nodes of the list k at a time and return the modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k, the remaining nodes at the end should remain in their original order.
Asked at:
Adobe
Microsoft
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late May, 2026
Microsoft
Senior
Pointer manipulation is bit tricky in the interview situation, looks like he doesn't expect a working code but mostly interested in how I dig myself in details and come out.
Late December, 2025
Adobe
Senior
Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is. You may not alter the values in the list's nodes, only nodes themselves may be changed.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.