Delete a Node from Linked List Problem Statement

Given a linked list of integers, your task is to implement a function that deletes a node at a specified position, 'POS'.

If the specified position is greater than or equal to the length of the linked list, return the linked list unchanged.

Input:

The first line of input contains an integer 'T', which indicates the number of test cases or queries. Each test case consists of two lines. The first line contains the elements of the linked list separated by spaces. The second line contains an integer 'POS', which denotes the position to delete the node from.

Output:

For each test case, output the resulting linked list with integers separated by spaces. Each output should be on a separate line.

Example:

Input:

3
3 4 5 6 -1
2
1 2 3 4 5 -1
4
10 20 30 40 -1
0

Output:

3 4 6
1 2 3 4
20 30 40

Constraints:

• 1 <= T <= 10^2
• 0 <= N <= 10^5
• POS >= 0

Note: Assume that the indexing for the linked list starts from 0, and -1 indicates the end of the singly linked list and is not a list element.