797. Search in Rotated Sorted Array
0
Medium
Given an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target value to search. If found in the array return its index, otherwise return -1.
Note:You may assume no duplicate exists in the array.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target value to search. If found in the array return its index, otherwise return -1.
Note:You may assume no duplicate exists in the array.
Input Format
First line contains size of Array.
Second line contains n elements of Array.
Third line contains target elements.
Output Format
Print the index of element if found , otherwise print -1.
Example
Input
7
4 5 6 7 0 1 2
0
Output
4
Constraints
Your algorithm's runtime complexity must be in the order of O(log n).
Loading...
View Submissions
Console