Problem Statement: Delete Node In A Linked List

Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked list has a unique value.

Input:

The first line contains an integer 'T' indicating the number of test cases. For each test case, the first line consists of space-separated integers representing the linked list nodes, ending with -1 (which is not a part of the linked list node values). The second line contains an integer K, the value of the node to be deleted.

Output:

For each test case, after deleting the specified node, print the modified linked list's node values, separated by a single space, followed by '-1' to denote the end of the list. Each result should be printed on a new line.

Example:

Input:
2
4 5 1 9 -1
5
4 5 1 9 -1
1

Output:
4 1 9 -1
4 5 9 -1

Constraints:

1

Question

Problem Statement: Delete Node In A Linked List

Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked list has a unique value.

Input:

The first line contains an integer 'T' indicating the number of test cases. For each test case, the first line consists of space-separated integers representing the linked list nodes, ending with -1 (which is not a part of the linked list node values). The second line contains an integer K, the value of the node to be deleted.

Output:

For each test case, after deleting the specified node, print the modified linked list's node values, separated by a single space, followed by '-1' to denote the end of the list. Each result should be printed on a new line.

Example:

Input:

Output:

4 1 9 -1
4 5 9 -1

Constraints:

1 <= T <= 100
2 <= N <= 5000
-10⁹ <= NODE.DATA <= 10⁹ and node.data != -1

Where 'N' denotes the number of nodes in the linked list and 'NODE.DATA' is the value of a node.

Note:

• The reference to the head of the linked list is not provided.
• The node to be deleted is not the tail node.
• Each node's value in the linked list is unique.
• The node to be deleted will always exist in the linked list.

Accepted Answer

Delete a specific node from a singly linked list given the reference to the node.

Traverse the linked list to find the node to be deleted.
Update the pointers to skip over the node to be deleted.
Print the modified linked list after deletion.