Applied online . Got interview call on-campus after a week or so, Two back to back interviews of 45 minutes. First interview was by the university alumni . He asked the following questions .
1) Find the maximum sum subset for a given array .
2) Given two sorted arrays find the elements of the first array not present in the second.
3) Given a N*N array where N is even such as 4, 8 and so on . Print the array from the center.
a= [1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16]
the output should be [6 10 12 7 3 2 1 5 9 13 14 15 16 12 8 4 ] .
The interviewer gave me sufficient time to think about the problem and then gave some tips as thou how it can be solved . Then he told me to write the code .
Second round of interview was very easy. the interviewer asked various question on the scenarios faced by amazon.
