| Excerpt |
|---|
Given a linked list, reverse the nodes of a linked list k at a time and return its 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. |
Example:
Given this linked list: 1->2->3->4->5
...