Leetcode Problem 206. Reverse Linked List

206. Reverse Linked List

Leetcode Solutions

Iterative Approach to Reverse a Singly Linked List

  1. Initialize three pointers: prev as null, curr as head, and next as null.
  2. Iterate through the list until curr is null: a. Store the next node by setting next to curr.next. b. Reverse the next pointer of curr by setting curr.next to prev. c. Move prev forward by setting it to curr. d. Move curr forward to next (the original next node).
  3. Once the iteration is complete, prev will be pointing to the new head of the reversed list. Return prev.
UML Thumbnail

Recursive Approach to Reverse a Singly Linked List

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...