The second question asks you to refactor a function in O(n^2) and make it O(n), basically by eliminating the nested for-loop. This is the function you're asked to refactor: int solution(int *A, int N) { int result = 0; int i, j; for (i = 0; i < N; i++) for (j = 0; j < N; j++) if (A[i] == A[j]) if (abs(i - j) > result) result = abs(i - j); return result; }
How would you parallelise this data-processing task?
If your wife got a job in seattle and you were offered a job at Grier, what would you do and what would you prioritize?
what is your thesis about?
Why you want to go out of India?
How to connect PC'c from one another?
How are your grades?
They asked me about myself.
What will you do, if the question doesn't fall in the category of your chosen subject?
Check errors on the Selenium Tests and debug them and find a solution.
Viewing 1 - 10 interview questions