Linked List Value Search Problem Statement

Given a Singly Linked List of integers accessible via a head pointer, where each node contains a specific integer value. You are required to determine if a node with a specified value K exists within the linked list.

Input:

The first line contains an integer 'T', the number of test cases. For each test case: The first line lists space-separated integers which are the node values of the linked list, ending with -1. Note that -1 is not a part of the list. The next line contains an integer 'K' that needs to be checked in the list.

Output:

Output 1 for each test case if the value 'K' is found, otherwise output 0, each answer on a new line.

Example:

Input: 2 
 1 2 3 4 -1 
 4 
 5 6 7 8 -1 
 10 
 Output: 1 
 0

Constraints:

• 1 <= T <= 10
• 1 <= L <= 10⁵
• 1 <= data <= 10⁹, data ≠ -1
• 1 <= K <= 10⁹

Note:

The implementation should focus on checking the existence of 'K' and does not require printing as that has been pre-handled.