Example 1: Input: head = [1,2,3,4,5], k = 2 Output: [2,1,4,3,5] Example 2: Input: head = [1,2,3,4,5], k = 3 Output: [3,2,1,4,5] |
||
---|---|---|
.. | ||
Cycle-Detection.cpp | ||
Find-Merge-Point.cpp | ||
Reorder-List.cpp | ||
Reverse_nodes_in_k_groups.cpp | ||
all-possible-insertion.cpp | ||
circular.cpp | ||
doubly.cpp | ||
merge.cpp | ||
remove-duplicates-in-sorted-linked-list.cpp | ||
remove-specific-elements.cpp | ||
reverse.cpp | ||
segregate-even-odd-nodes-of-linked-list.cpp | ||
singly.cpp |