← Questions
Reverse a linked list between nodes with equal values
0
I was asked this
No reports yet. Sign in to say where you were asked it.
In a singly linked list, whenever two nodes hold the same value, reverse the part of the list between them. Clarify with the interviewer which pairs count and whether the matching nodes themselves move, then do it in place in one pass.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Write and test your solution herePython in your browser, the question's tests level by level, saved for you.Sign in to start coding
