# Will this also be an acceptable solution for this problem?

``````public static int search(int[] arr, int key) {

if(arr == null || arr.length == 0) {
return -1;
}

int pivotIdx = findPivotIdx(arr);
int res = find(arr, key, 0, pivotIdx);
if(res != -1) {
return res;
}

return find(arr, key, pivotIdx + 1, arr.length - 1);
}

private static int findPivotIdx(int[] arr) {

int left = 0;
int right = arr.length - 1;
int mid = right / 2;
while(left < mid) {
if(arr[left] < arr[mid]) {
left = mid;
}
else {
right = mid;
}

mid = left + (right - left) / 2;
}

return mid;
}

private static int find(int[] arr, int key, int start, int end) {
int left = start;
int right = end;
int mid = start + (end - start) / 2;
while(left <= right) {
if(key < arr[mid]) {
right = mid - 1;
}
else if(key > arr[mid]) {
left = mid + 1;
}
else {
return mid;
}

mid = left + (right - left) / 2;
}

return -1;
}
``````

Type your question above this line.

Hello @Peter_Litvak ,
Your solution is working fine with the inputs but the solution here Solution Review: Problem Challenge 2 - Grokking the Coding Interview: Patterns for Coding Questions is more concise and efficient.

Thanks.

Why is it more efficient? Concise, sure, if it’s literally fewer lines of code, but that’s also not always desirable. More explanation would make this a much more useful answer.