Given the head of a linked list, reverse the nodes of the list k at a time,
Fantastic news! We've Found the answer you've been seeking!
Question:
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.
Example 1:
Input: head = [1,2,3,4,5], k = 2Output: [2,1,4,3,5]Example 2:
Input: head = [1,2,3,4,5], k = 3Output: [3,2,1,4,5]
Constraints:
- The number of nodes in the list is n.
- 1
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: