Swap Kth Node From Beginning And End In Linked List

easy
1. You are given a linked list with N nodes.
 2. You are also given a number K.
 3. You have to write a function that swaps Kth nodes from beginning and end
    of the list.
 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 swapkthnode function. It takes as input the
    head of the linked list, N and K. 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 and K. Next line takes input N space separated numbers reperesenting elements of the linked list. Input is handled for you.

Output Format

Linked List with Kth nodes from ends swapped. Output is handled for you.

Constraints

1 <= K<= N <= 300

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
4 1
1 2 3 4
Output
4 2 3 1 
Previous
Sort Linked List By Quick Sort
Next
Array With Two Stacks

Related Questions