← Questions
Reverse nodes in k-group
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Reverse a linked list in groups of k nodes, leaving a final group shorter than k as it is. Do it in place with O(1) extra space.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding