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?
Why did you apply to this programme?
Would you prefer to have new products through innovation or focus on your current main products? Please provide me some examples from your prior experiences to answer this question.
Biggest challenges for the Google sales team?
Cases
Please tell me what you have done previously related to quantitative analysis?
Count the number of A's friends' friends who are also A's friends. And some problems related to their business, ask about the approach of solving such problems.
describe a work challenge and how you dealt with it
waiting for the round yet
Why Wayfair?
Viewing 1311 - 1320 interview questions