Reverse Linked List

Easy🔗 Linked Lists

50 XP

Problem

Given the head of a singly linked list, reverse the list and return the reversed list.

Examples

Input: 1 → 2 → 3 → 4 → 5
Output: 5 → 4 → 3 → 2 → 1

Input: 1 → 2
Output: 2 → 1

linked-listtwo-pointerrecursion

AI Assistant— powered by AI

Unlock hints progressively — start gentle, go deeper only if needed.

💡

Level 1: Gentle Nudge

A subtle direction

🗺️

Level 2: Approach

The algorithm to use

🔍

Level 3: Detailed

Step-by-step guidance

21 / 150

Your Solution

⚡ JavaScript

class ListNode { constructor(val, next=null) { this.val=val; this.
next=next; } }
function reverseList(head) {
  // Iterative: prev, curr pointers
  
}
// Build: 1->2->3->4->5
const head = new ListNode(1, new ListNode(2, new ListNode(3, new ListNode(4, 
new ListNode(5)))));
const rev = reverseList(head);
let n = rev; while(n) { process.stdout.write(n.val + (n.next?' -> ':'')); n=n.
next; }

to save progress and use AI features