Reverse Linked List II

Try to solve the Reverse Linked List II problem.

We'll cover the following

Statement

Given a singly linked list with nn nodes and two positions, left and right, the objective is to reverse the nodes of the list from left to right. Return the modified list.

Constraints:

  • 1≤1 \leq n ≤500\leq 500
  • −5000≤-5000 \leq node.data ≤5000\leq 5000
  • 1≤1 \leq left ≤\leq right ≤\leq n

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