Concept
Reversing a linked list in place means walking it once and flipping each next pointer to point backwards. Three variables, previous, current and next, are all it takes.
The tutor works through these with you, in conversation and code. A session ends when you have shown them, not when a video does.
A few lines that show Reversing a list doing its job.
def reverse(head):
previous = None
current = head
while current:
following = current.next # save before overwriting
current.next = previous
previous = current
current = following
return previous # the new headReturning head instead of previous. After the loop, head is the old first node, now the tail, and previous holds the new head.
Your roadmap puts these before Reversing a list, unless you already know them.
Once a session shows you understand Reversing a list, it comes back for review. Each review takes a minute and tells the memory model how well you still know it.