The challenge
Reverse an acyclic singly linked list in place and return its new head.
Reuse the existing nodes; only next pointers change.
Example
[1, 2, 3, 4] → [4, 3, 2, 1].
Use the walkthrough below to inspect the input and each state change.
See Reverse list, step by step
Follow the pointers. Watch each link change.
4 nodes · singly linkedIDs = node identity · ∅ = null
CurrentResultYellow arrow: changed next link
head
A1Inspect node links
| Node | Value | Next |
|---|---|---|
| A1 | 1 | A2 |
| A2 | 2 | A3 |
| A3 | 3 | A4 |
| A4 | 4 | null |
Step 01 / 14
Read the input
IDs label node objects. Equal values can belong to different nodes. Solid arrows are next links; dashed arrows are random links.
Start from the input head pointers.View original input
A: 1 (A1) → 2 (A2) → 3 (A3) → 4 (A4); parameters: {}
Parameter indices are zero-based, except n from the end, which is one-based. Node IDs remain fixed when links change.
Put it into code
Keep the reversed prefix separate from the unprocessed suffix.
Node stores val and next; the random-pointer lesson adds random. C++ uses C++17 or later.
class Node:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
def reverse(head):
prev = None
curr = head
while curr:
nxt = curr.next
curr.next = prev
prev, curr = curr, nxt
return prev
#include <cstddef>
struct Node {
int val;
Node* next;
Node(int value = 0, Node* link = nullptr)
: val(value), next(link) {}
};
Node* reverse(Node* head) {
Node* prev = nullptr;
while (head) {
Node* next = head->next;
head->next = prev;
prev = head;
head = next;
}
return prev;
}