Problem title
Difficulty
Avg time to solve

Easy
15 mins
Insertion In A Singly Linked List
Easy
15 mins
Height of Binary Tree
Easy
15 mins
Easy
12 mins
Count Numbers With Equal First and Last Digit
Moderate
15 mins
Count Numbers Containing Given Digit K Times
Moderate
30 mins
Rotate Clockwise
Easy
15 mins
Prime Digit Sum
Hard
45 mins
Ninja And The Clan
Moderate
24 mins
Missing Number
Easy
13 mins

Difficulty: EASY
Contributed By
Avg. time to solve
15 min
Success Rate
90%

Problem Statement

You are given a Doubly Linked List of ‘N’ positive integers. Your task is to delete a node at position ‘POS’ in the linked list.

Note:
``````Assume that the Indexing for the linked list starts from 0.
``````
EXAMPLE:
``````Input: ‘N’ = 5, 'LIST' = [1, 1, 2, 3, 4, -1], ‘POS’ = 1.

Output: 1 < - > 2 < - > 3 < - > 4

Here in the given list, we can see that the node at position 1 is deleted.
``````
Input Format :
``````The first line of input contains a single integer T, representing the number of test cases or queries to be run.

The second line of the test case contains space-separated integers which are the nodes of the linked list and each line ends with -1 to indicate that the sublist is over. Thus, -1 will never be a linked list element.

The third line of each test case contains a single integer ‘POS’ denoting the position at which the node has to be deleted.
``````
Output format :
``````The first and only line of each test case in the output contains the linked list after deleting the required element.
``````
Note :
``````You don't need to print anything. It has already been taken care of. Just implement the given function.
``````
Constraints :
``````1 <= ‘T’ <= 10
2 <= ‘N’ <= 10^4
0 <= ‘POS < N
1 <= ‘data’ <= 10^7
Where 'N' is the size of the doubly linked list, and ‘data’ is the Integer data of the doubly linked list.

Time Limit: 1 sec
``````
Sample Input 1 :
``````2
1 1 2 3 4 -1
1
1 2 -1
1
``````
Sample Output 1 :
``````1 2 3 4
1
``````
Explanation Of Sample Input 1 :
``````For the first test case,
‘N’ = 5, 'LIST' = [1, 1, 2, 3, 4, -1], ‘POS’ = 1.
After deleting the node at position 1 the list will be:
1 < - > 2 < - > 3 < - > 4.

For the second test case,
‘N’ = 2,  'LIST' = [1, 2, -1], ‘POS’ = 1.
After deleting the node at position 1 the list will be:
1.
``````
Sample Input 2 :
``````2
1 2 3 -1
0
3 4 4 -1
2
``````
Sample Output 2 :
``````2 3
3 4
``````
Console