Tap here to switch tabs
Problem
Submissions

Problem: Reverse Linked List

Reverse Linked List takes the head of a singly linked list and asks you to reverse the links between its nodes, then return the head of the resulting list.

Statement

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

Constraints:

Let n be the number of nodes in a linked list.

  • 1≤1 \leq n ≤500\leq 500
  • −5000≤-5000 \leq Node.value ≤5000\leq 5000
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Reverse Linked List

Reverse Linked List takes the head of a singly linked list and asks you to reverse the links between its nodes, then return the head of the resulting list.

Statement

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

Constraints:

Let n be the number of nodes in a linked list.

  • 1≤1 \leq n ≤500\leq 500
  • −5000≤-5000 \leq Node.value ≤5000\leq 5000