CareerCup

Could you please rephrase the question in a more understandable way. Thanks!

why b[]?

i=0;
while(i<n1 && (n-1-i)>=0 && a[i]==b[n-1-i])
i++;

Do you mean the problem of finding the longest common sub string ?

int match(int * a, int m, int * b, int n)
{
    if(m == 0 || n == 0)
        return -1;
    
    int flag = 0, highest = -1;
    for (int i=0; i < m; i++)
    {
        int k = 0;
        int j = (n-1);
        
        while(1)
        {
            if(k <= i && j>=(n-1-i))
            {
                if(a[k] != b[j])
                {
                    flag = 1;
                    break;
                }
            } else {
                break;
            }
            
            k = k + 1;
            j = j - 1;
        }
        
        if(flag != 1)
            highest = i;
    }
    
    return highest;
}

>B[N-1...N-1-i]

Do you mean B[N-1-i...N-1] or B[m-i..m] where N is the no. of elements in B and m<N?

int returnValue = -1;
for(int i=0, j=b.length - 1; i<a.length, j=0; i++, j--) {
if(a[i] != b[j]) {
returnValue = i;
break;
}
}
return returnValue;

for (index=0; index < A.length && index < B.length; index++) {
if (A[index] != B[B.length - index - 1]) break;
}

I can not understand your question.

void maxIndex(int a[],int b[]){
		int len=b.length-1;
		for(int i=0;i<a.length&&len>=0;i++){
			if(a[i]!=b[len]){
				System.out.print("Max Index::"+(i-1));
				break;
			}
			len--;
		}
	}

logical representation?