Given a sorted and rotated array A of N distinct elements which is rotated at some point, and given an element K. The task is to find the index of the given element K in the array A.
Input:
The first line of the input contains an integer T, denoting the total number of test cases. Then T test cases follow. Each test case consists of three lines. First line of each test case contains an integer N denoting the size of the given array. Second line of each test case contains N space separated integers denoting the elements of the array A. Third line of each test case contains an integer K denoting the element to be searched in the array.
Output:
Corresponding to each test case, output the index of the element found in the array. If element is not present, then output -1.
Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 107
0 ≤ Ai ≤ 108
1 ≤ K ≤ 108
Example:
Input:
3
9
5 6 7 8 9 10 1 2 3
10
3
3 1 2
1
4
3 5 1 2
6
Output:
5
1
-1
Explanation:
Testcase 1: 10 is found at index 5.
** For More Input/Output Examples Use 'Expected Output' option **
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.
| CodeBuddy | 164 |
| hardikJain5 | 142 |
| Akkki111 | 141 |
| __forgivingyou | 120 |
| saurabhgrade1 | 108 |
| KshatriyaYash | 1932 |
| nikhil_sojan | 1374 |
| lonecoder | 1236 |
| SumitSingh27 | 1103 |
| mazumderrohit8 | 1095 |
| blackshadows | 5327 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4572 |
| Quandray | 4444 |