Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

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.

```
Assume that the Indexing for the linked list starts from 0.
```

```
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.
```

Detailed explanation

```
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.
```

```
The first and only line of each test case in the output contains the linked list after deleting the required element.
```

```
You don't need to print anything. It has already been taken care of. Just implement the given function.
```

```
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
```

```
2
1 1 2 3 4 -1
1
1 2 -1
1
```

```
1 2 3 4
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.
```

```
2
1 2 3 -1
0
3 4 4 -1
2
```

```
2 3
3 4
```