You are given an array of integers, A1, A2, ..., An, including negatives and positives, and another integer S. Now we need to find three different integers in the array, whose sum is closest to the given integer S. If there exists more than one solution, any of them is ok. Is there an algorithm to find the three integers in O(n^2) time?
Calculate var(x) given that the data points distribute uniformly on a 3D sphere.
How would you deal with a dataset that was too large to load into memory?
What is a 1572?
How would you handle a coordinator that was not getting the work completed in a timely manner.
very basic concepts of M&A
What is more important, the quality of the product or the strength of the support?
potatoes are put to dry on Day 1, they have 99% water content. On day too they loose water content and now it's 98% of the mass. How much has the weight reduced?
why do you think you are suitable for this role?How can you contribute to the organization?
After the proteins have been transferred from the gel what happens next?
Viewing 201 - 210 interview questions