Reverse Linked List From M To N

easy
1. You are given a singly linked list N nodes.
  2. You are also given two numbers m and n.
  3. You have to write a function that reverses the linked list from position 
     m to n. Do it in one pass.
  4. display is a utility function which displays the contents of Linked List,
     feel free to use it for debugging purposes.
  5. main takes input from the users and creates the Linked List. You can use
     display to know its contents.
  6. This is a functional problem. 
  7. You should code only the reverseBetween function. It takes as input the
     head of the linked list, m and n. It should return the head of the modified
     linked list.
  8. Don't change the code of Node, main and display.

Input Format

First line takes N, the number of elements in the list. Second line takes input N space separated numbers reperesenting elements of the linked list. Third line takes input m and n. Input is handled for you.

Output Format

Modified Linked List. Output is handled for you.

Constraints

1 <= m <= n <= N <= 1000

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
6
1 2 3 4 5 6
2 5
Output
1 5 4 3 2 6
Previous
Remove Loop In Singly Linked List
Next
Dgdfg

Related Questions