Interview Questions

Ashvini B. - "Clarifying Questions: What's the goal of this feature? I am assuming the goal is to improve the experience. 2) Are we focused on any specific brand? Tesla, Waymo? - I am assuming in general 3) Market - US 4) For the purpose of this question, I am assuming elf-driving cars are fully safe/autonomous and doesn't need any attention from the users to reach from point A to B. Revised problem statement - Design a feature for self-driving cars to improve the experience. User-segments: People who use i"See full answer

Anjesh D. - "I had multiple RCA to complete and each one had a deadline but the process to complete them wasn't streamlined which cause some of them to miss SLA and point of contact felt frustrated as she has no information to give to customer. I received feedback that what blocked me to move forward on those and how can I do better next time?"See full answer

Beth S. - "The DNS server of the site URL can identify the source of the traffic via GeoIP and redirect it to the Amazon services closest to that location. The load balancer, installed before the web server, can manage the load and redirect traffic to redundant services."See full answer

Michael F. - "As an interviewer, I have asked this question to candidates in the past. Here are the major topics I am looking for in an interview The candidate should understand that there are ways of measuring the loss of a particular clustering. For example, we can take the average distance of each point to it's cluster center. The candidate should understand that this loss will always decrease as the number of clusters increases. For that reason, we can't just pick the value of K that minimizes the l"See full answer

Dinar M. - "Even more faster and vectorized version, using np.linalg.norm - to avoid loop and np.argpartition to select lowest k. We dont need to sort whole array - we need to be sure that first k elements are lower than the rest. import numpy as np def knn(Xtrain, ytrain, X_new, k): distances = np.linalg.norm(Xtrain - Xnew, axis=1) k_indices = np.argpartition(distances, k)[:k] # O(N) selection instead of O(N log N) sort return int(np.sum(ytrain[kindices]) > k / 2.0) `"See full answer

Nathan C. - "def mostefficientseqscore(parentheses, efficiencyratings): mes = [] for i in range(len(parentheses)): mes.append((parentheses[i], max(efficiency_ratings[i])) return sum([m[1] for m in mes]) `"See full answer

Pranav M. - "Statement: Improve the music experience at youtube Is the goal to improve the experience for any particular kind of user/music genre? Ans: No, nothing in particular Goal: I’m going to assume the goal is to improve the experience of listening to music generally Google’s mission is to organise the world’s information. Youtube is a platform that lets people discover videos, interesting content as tailored to their interests, thus serving Google’s mission Music on Youtube also contributes to"See full answer

Dr. chantel P. - "Currently, I work in banking fraud detection. Recently, my teammate and myself were asked to assist the Check Deposits team in enhancing their fraud detection ML solution by evaluating new data sources and eliminating past data sources for possible lift. We retrieved data from Hadoop and Netezza databases including deposit transaction data, mobile & computer device, authentication logs, account balance, and customer demographic data. We then created new and recreated old features including tem"See full answer

Rahul J. - "find total sum. assign that to rightsum traverse from left to right: keep updating left sum and right sum, when they match return the index. else if you reach end return -1 or not found"See full answer

Zacharias E. - "SELECT pro.id, pro.title, pro.budget, COUNT(employeeid) AS numemployees, SUM(e.salary) as total_salaries FROM projects pro JOIN employeesprojects ep ON ep.projectid = pro.id JOIN employees e ON e.id = ep.employee_id GROUP BY project_id; `"See full answer

Divya R. - "public static Integer[] findLargest(int[] input, int m) { if(input==null || input.length==0) return null; PriorityQueue minHeap=new PriorityQueue(); for(int i:input) { if(minHeap.size()(int)top){ minHeap.poll(); minHeap.add(i); } } } Integer[] res=minHeap.toArray(new Integer[0]); Arrays.sort(res); return res; }"See full answer

Harsh W. - "Me: That's an interesting challenge. I would like to get some clarifications before jumping into potential solutions. Are we talking about the global search market irrespective of device or are we talking about a specific geography / device type? Interviewer: Lets go ahead with all possible searches. Me: Ok. Is there a specific reason we want to capture a significant market share from Google (e.g. higher search revenue, cross-selling MSFT services etc.) and are there any timelines we should k"See full answer