Interview Question for Software Engineer / Developers

Comment hidden because of low score. Click to expand.
0
of 0 vote

int findSeg(int* A, int len){
int l = 0;
int r = len;
if (A[len-1] > A[0])
return 0;
while (l<r){
int mid = (l+r)/2;
if (mid == 0 || mid == len-1 || A[mid] < A[mid+1] && A[mid] < A[mid-1])
return mid;
else if (A[mid] < A[0])
r = mid;
else
l = mid+1;
}
return -1;
}

Comment hidden because of low score. Click to expand.
0

how is this algo related with given question

Comment hidden because of low score. Click to expand.
0
of 0 vote

you can solve this problem using an modified version on the binary search.

Comment hidden because of low score. Click to expand.
0
of 0 vote

int FindRotationIndex(int a[], int start, int end)
{
if(a[start]<=a[end])
return 0;

int mid = (start+end)/2;
if(a[mid] > a[mid+1])
return mid+1;
if(a[mid-1] > a[mid])
return mid;

if(a[mid+1] > a[end])
FindRotationIndex(a,mid+1,end);
else
FindRotationIndex(a,start,mid-1);
}

Comment hidden because of low score. Click to expand.
0

nice :)

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````int FindRotationIndex(int a[], int start, int end)
{
if(a[start]<=a[end])
return 0;

int mid = (start+end)/2;
if(a[mid] > a[mid+1])
return mid+1;
if(a[mid-1] > a[mid])
return mid;

if(a[mid+1] > a[end])
FindRotationIndex(a,mid+1,end);
else
FindRotationIndex(a,start,mid-1);
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

i think this function should have a return statement

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.