Reverse Linked List
Read the lesson → understand the pattern → then code. Tutor works offline (built-in teacher); optional Cursor/Gemini keys upgrade chat quality.
Topic refresher: Linked List — Pointer Surgery
Redraw next pointers carefully; draw on paper first.
ListNode* prev = nullptr;
ListNode* cur = head;
while (cur) {
ListNode* nxt = cur->next;
cur->next = prev;
prev = cur;
cur = nxt;
}
return prev;EasyLinked ListLeetCode #206
Reverse Linked List
Three pointers: prev, cur, next. Classic interview.
Examples
Example 1
Input
5 1 2 3 4 5
Output
5 4 3 2 1
Example 2
Input
2 1 2
Output
2 1
Stuck? Take a nudge
C++17Autosaves