This post explains leetcode problem 206. reverse linked list using python 3. For example, let’s say there is a linked list: 1 -> 2-> 3-> 4 -> 5. After reversing the list, the expected result is 5 -> 4 -> 3 -> 2 -> 1. This is a fairly easy problem and there is a couple of ways to solve this. Using stack This method uses extra space (stack) as the name indicates. The algorithm is:1. As iterating the original linked list, create the node and push it to the top of the stack. Note that the next pointer should READ MORE