Reverse Nodes in k-Group at Microsoft
Hard65.3% acceptance
This problem has 62.5% frequency at Microsoft.
Problem Description
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...
Read full problem and hintsTopics
Also asked at 27 companies
More Microsoft Questions
LRU CacheMediumAdd Two NumbersMediumMerge Two Sorted ListsEasyMerge k Sorted ListsHardPow(x, n)Medium
View all Microsoft questions