Reverse Linked List

Try to solve the Reverse Linked List problem.

We'll cover the following

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

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy