Search In Rotated Sorted Array Problem Statement

Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

Note:

1. If 'K' is not present in ARR, return -1.
2. The array contains no duplicate elements.
3. ARR is only rotated to the right.

Input:

The first line contains an integer 'T', the number of test cases.
Each test case contains:
- Two space-separated integers 'N' and 'K'.
- A line with 'N' space-separated integers representing the elements of ARR.

Output:

For each test case, output the index where 'K' is found in ARR.

Example:

Suppose ARR = [12, 15, 18, 2, 4] and K = 2. The index where K is present in the array is 3 (0-indexed).

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 5000
• 0 ≤ K ≤ 105
• 0 ≤ ARR[i] ≤ 105