Delete x^{th} node from a singly linked list. Your task is to complete the method **deleteNode()** which takes two arguments: the address of the head of the linked list and an integer x. The function returns the head of the modified linked list.

**Input:**

The first line of input contains an element T, denoting the number of test cases. Then T test cases follow. Each test case contains three lines. The first line of each test case contains an integer N denoting the number of elements of the linked list. Then in the next line are N space separated values of the linked list. The third line of each test case contains an integer x.

**Output:**

The output for each test case will be the space separated value of the returned linked list.

**User Task:**

The task is to complete the function **deleteNode**() which should delete the node at required position.

**Constraints:**

1 <= T <= 300

2 <= N <= 100

1 <= x <= N

**Example:
Input:**

2

3

1 3 4

3

4

1 5 2 9

2

**Output:**

1 3

1 2 9

**Explanation:
Testcase 1:** After deleting the node at 3rd position (1-base indexing), the linked list is as 1-> 3.

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

murli01 | 343 |

decoder_101 | 216 |

Sulagna | 189 |

kya_bolti_public | 172 |

madhursengar24 | 172 |

PiyushPandey4 | 717 |

john_wick | 681 |

ASWATHAMA | 565 |

akhyasharma01 | 547 |

jagrit_ | 507 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4598 |

Login to report an issue on this page.