Search In Rotated Sorted Array
Posted: 21 Jul, 2020
Aahad and Harshit always have fun by solving problems. Harshit took a sorted array 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 founds it, he had to shout the index of the number, otherwise, he had to shout -1.
Can you solve each query in O(logN) ?
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.
1 <= N <= 10^6 -10^9 <= A[i] <= 10^9 1 <= Q <= 500 -10^9 <= Q[i] <= 10^9 Time Limit: 1sec
The idea here is to do a linear approach which apparently is a brute force way to do this.
- Visit every element one by one.
- Check if the current element that you are looking at is the key value that needs to be searched. If the element is found, return the index at which you find it.
- Once all the elements are visited and you don't find the key-value, return -1.
Optimize Memory Usage
Posted: 25 May, 2021
Posted: 15 Jun, 2021
Make Array Elements Equal
Posted: 4 Jul, 2021
Ninja And Trains
Posted: 10 Jul, 2021
Longest Common Prefix
Posted: 24 Jul, 2021