Today I'd like to give codes and solution to reverse a singly linked list in a single pass and not using superfluous storage. Off course there is a solution if you duplicate list, put all values into a vector or array, and other not efficient ways to accomplish this task. Recursive solutions could also be proposed. … Continue reading Reversing a singly linked list in a single pass →