Given two integer arrays, write a function which can compute the product of first array and save in the second array, except the product of that particular element from first array of same index you currently store in second array. A = [a(0), a(1), a(2), a(3) ... a(n)] B = [b(0), b(1), b(2), b(3) ... b(n)] where b(0) = a(1) x a(2) x a(3) .... x a(n) b(1) = a(0) x a(2) x a(3) .... x a(n) . . . b(n) = a(0) x a(1) x a(2) .... x a(n-1)
Given certain assumptions, why won't the water reach the top of the cliff with the designated pump?
I had to generate code to create your API calls via doc's
Can you follow instructions and blueprints?
My major area of interest
What is deadlock?
Why are you interested in water and what relevant skills/knowledge do you have?
What do you think of Cypress' Core Values?
Lalit interviewed me technically for about 2 hours and most of his questions weren't extremely challenging, but intelligent. One of the questions was about designing an edge weighted graph implementation for a 'friendlist'
Expected CTC
Viewing 1031 - 1040 interview questions