Checkout your overall progress in every topic here
in DSA topics
Open the topic and solve more problems associated with it to improve your skills
Check out the skill meter for every topic
See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.
Search In Rotated Sorted Array
Avg time to solve 30 mins
Success Rate 65 %
Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1, 2, 3, 4, 5] and if he rotates it by 2, then the array becomes: [4, 5, 1, 2, 3].
After rotating a sorted array, Aahad needs to answer Q queries asked by Harshit, each of them is described by one integer Q[i]. which Harshit wanted him to search in the array. For each query, if he found it, he had to shout the index of the number, otherwise, he had to shout -1.
For each query, you have to complete the given method where 'key' denotes Q[i]. If the key exists in the array, return the index of the 'key', otherwise, return -1.
Can you solve each query in O(logN) ?
Detailed explanation ( Input/output format, Notes, Constraints, Images )
The first line of input contains the size of the array: N
The second line contains N single space-separated integers: A[i].
The third line of input contains the number of queries: Q
The next Q lines of input contain: the number which Harshit wants Aahad to search: Q[i]
For each test case, print the index of the number if found, otherwise -1.
Output for every test case will be printed in a separate line.
You are not required to explicitly print the expected output, just return it and printing has already been taken care of.