Ninja and Infinite Size Array Problem Statement

Given an array/list ‘ARR’ of unknown size, sorted in ascending order with all distinct elements, and an element ‘TARGET’, find the position of 'TARGET' in the ‘ARR’ if it is present. To access elements of ‘ARR’, use the interface ‘readValueAtIndex’, returning ‘10 ^ 9 + 7’ if accessing an out-of-bounds index.

Example:

Input:

ARR = {2, 4, 7, 10}

Output:

1

Explanation:

Using ‘readValueAtIndex(0)’ returns 2. Accessing a non-existent index, such as ‘readValueAtIndex(10)’, returns ‘10 ^ 9 + 7’. Find the index of ‘TARGET’.

Constraints:

• 1 ≤ T ≤ 100 - Number of test cases
• 1 ≤ N ≤ 5000 - Size of the known array in test cases
• 1 ≤ ARR1[i], TARGET ≤ 100000 - Elements in 'ARR' and the search target

Note:

If 'TARGET' is not found, return -1. Implement the function without printing anything, as output handling is managed.