In Chapter on stack and queues, the bootcamp talks about reversing a linked list. It says “iterate through the list printing entries , then perform another reverse to recover the list”. And then says it has O(1) space compelity.
what’s it talking about why are we printing entries?
I also don’t get perform another “reverse” phrase.