![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644913420324-Iteratively%20Reverse%20a%20Linked%20List%20Using%20Only%202%20Pointers_Artboard%203.png\")
<\/p>\n<\/p>\n
The linked list is one of the most important concepts and data structures to learn while preparing for interviews. Having a good grasp of Linked Lists can be a huge plus point in a coding interview.<\/p>\n<\/p>\n
We will be provided with a linked list, we aim to reverse the given linked list, but we are constrained to use only 2 pointers.<\/p>\n
Consider Example:<\/strong> Output Linked List: <\/p>\n In this problem, we are given a Linked List, and we are asked to reverse the provided Linked List. We can get the desired reversed linked list by just swapping<\/a> the values of nodes from front to end.<\/p>\n For example:<\/strong> So, Essentially, we can just swap the values of node such that:<\/p>\n Our input linked list after swapping the node values will be: head \u2192 5 \u2192 4 \u2192 3 \u2192 2 \u2192 1 \u2192 NULL.<\/p>\n The output linked list which we got after swapping the nodes is basically the reverse of our original linked list. Hence objective achieved.<\/p>\n We have already seen how to reverse a Linked List Using 3 Pointers. To read about the article, you can visit Reverse a Linked List<\/a>.<\/p>\n In this article, we will see how we can achieve the same result using only 2 pointers.<\/p>\n If you could remember from the previous article, where we were using 3 Pointers, you can easily see that these were the 4 lines that were important for manipulating the next pointer of node:
\nInput Linked List:<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/input-22.png\")
<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/output-12.png\")
<\/p>\nProblem Statement Understanding<\/h3>\n
\nLinked List: head \u2192 1 \u2192 2 \u2192 3 \u2192 4 \u2192 5 \u2192 NULL<\/p>\n\n
Helpful Observation<\/h4>\n
\n
\n\t\t\t\t\t\t