## Amazon Interview Question for Backend Developers

• 0

Country: United States
Interview Type: In-Person

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

I don't understand this question! Given any matrix, what is the output?

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

Given boolean matrix of 0s and 1s find size of x that is x should be form from connecting number of of ones. for the below example size of x is 3.
include element 1st, midle,last right,last from last row,midle,last from fistmrt row element that forms x.
1 1 1
1 1 1
1 1 1
If input matrix is
1 0 0
1 1 1
1 1 1.
Output: 0
We not find x in matrix

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

int arr[][]={{1,1,1},{1,1,1},{1,1,1}};
System.out.println("arr.length is: "+arr.length);
for(int m=0;m<arr.length;m++) {
if(arr.length-m-1 == m) {
System.out.print(" "+arr[m][m]+" ");
System.out.println();
} else {
System.out.print(arr[m][m]+" "+arr[arr.length-m-1][m]);
System.out.println();
}

}

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

``````int arr[][]={{1,1,1},{1,1,1},{1,1,1}};
System.out.println("arr.length is: "+arr.length);
for(int m=0;m<arr.length;m++) {
if(arr.length-m-1 == m) {
System.out.print(" "+arr[m][m]+" ");
System.out.println();
} else {
System.out.print(arr[m][m]+" "+arr[arr.length-m-1][m]);
System.out.println();
}

}``````

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

``int arr[][]={{1,1,1},{1,1,1},{1,1,1}};``

``System.out.println("arr.length is: "+arr.length);``

for(int m=0;m<arr.length;m++) {
if(arr.length-m-1 == m) {
System.out.print(" "+arr[m][m]+" ");
System.out.println();
} else {
System.out.print(arr[m][m]+" "+arr[arr.length-m-1][m]);
System.out.println();
}

}

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

static void findX()
{
int xLen = 0;
int[,] arr = new int[5, 5] { { 1, 1, 1, 1, 0 }, { 0, 0, 1, 1, 0 }, { 1, 1, 1, 1, 1 }, { 1, 1, 1, 1, 1 }, { 1, 1, 1, 1, 1 } };
for (int i = 0; i < arr.GetLength(0); i++)
{
for (int j = 0; j < arr.GetLength(1); j++)
{
Console.Write(\$"{arr[i, j]} ");
}
Console.WriteLine();
}

for (int i = 1; i <= arr.GetLength(0) - 2; i++)
{
int j = 1;
while (i - j >= 0 && i + j < arr.GetLength(0) && i + j < arr.GetLength(1))
{
if (arr[i, j] == 0)
{
j += 1;
continue;
}
else if (arr[i - j, i - j] == 0 || arr[i - j, i + j] == 0 || arr[i + j, i + j] == 0 || arr[i + j, i - j] == 0)
{
j += 1;
continue;
}
else if (xLen <= 1 + j *2)
xLen = 1 + j * 2;

j += 1;
}

}

if (xLen > 2)
Console.Write(xLen);
}

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

``````for(int i=1;i<=l;i++) {
for(int j=1;j<=l;j++){
if(i==j||(i+j)-1==l){
System.out.print("1");
}else{
System.out.print(" ");
}
}
System.out.println();
}``````

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.