It consisted of 2 phone interviews each lasted about 45mins. The questions I could remember are: Assume you have an array A of n numbers (non-zero real numbers, not sorted), you need to create an array B, where the ith element of B equals the product of all elements in A except A[i]. In other words: B[i] = A[0]*A[1]*....A[i-1]*A[i+1]*....A[n-1] Do not use divisions. Only use addition and multiplications. Minimize the time complexity(use as few as multiplications as possible). The solution is easy: use helper array A1, A2: A1[i] is product of A[0] to A[i-1], use dynamic programming to calculate gradually and save multiplications A2[i] is product of A[n-1] to A[i+1], use same technique as above only in another direction. B[i]=A1[i]*A2[i] The third interview is from a SDET team asking me if I'm interested in testing and some testing questions. I feel that I went on well. However I got declined a week after. Probably they have people interviewed before me fill in the position.