Interview Questions

Exponent - "This is a Diagnosis problem. To answer this question, we suggest you use our framework (along with the TROPIC method) to be as thorough as possible. The framework is as follows: Ask clarifying questions List potential high level reasons Gather Context (TROPIC)Time Region Other features / products (internal) Platform Industry / Competition Cannibalization Establish a theory of probable cause Test theories Propose solutions Summarize As"See full answer

Exponent - "This is a Fermi problem — an estimation or approximation problem with limited information and back-of-the-envelope calculations. There's no right answer: interviewers want to understand how you think and how well you can explain your reasoning, rather than what you already know. Recall the formula for Fermi problems: Ask clarifying questions Catalog what you know Make equation(s) Think about edge cases to add to equation **Breakdown components of your equat"See full answer

Exponent - "This is an Improve a Product question. Let's first go over the Improve a Product formula: Ask clarifying questions Identify users, behaviors, and pain points State product goal Brainstorm small improvements Brainstorm bolder improvements Measure success Summarize Now, let's begin! Ask clarifying questions Before we begin listing off recommendations, it's important you ask questions to ensure you and the interviewer are on the same page"See full answer

Jr H. - "for one time i was working as a receptionist in a hotel and one of the rooms that the customer needed was not available but rather we had diffrent room with the same quality i had to convince the customer to use the room we had and i would personally transfer him to the room he desires when its available"See full answer

Archana C. - "I was not very confident in my answers. My explanations were round about and I was mostly nervous."See full answer

Celia F. - "I want to work here because I've researched your company's goals and objectives, particularly your focus on breaking into the retail market, specifically in the area of e-commerce. I'm genuinely excited about the opportunity to contribute to your success in this endeavor. Based on our discussions and my understanding of your organization's needs, I believe my background and experience align perfectly with what you're aiming to achieve. In my previous roles at Havas Media Group and EPA Digital,"See full answer

Rahul J. - "This depends on the following two variables: What's the percentage of people dropping off at each step What's the perceived impact to business and users of the failure of each step. In general, I'd start from the very end, and then go back in the process as it's more important that we satisfy customers who have paid i.e. they should get a booking confirmation vs customers that are entering details and then payment info."See full answer

Jennifer C. - "Reproduce the bug, read error messages, isolate the problem, use a debugger, check assumptions, review recent changes, consult documentation, Text Edge Cases, take break"See full answer

Tyler V. - "This is a very interesting question. First, I would like to ask a few clarifying questions about the premise, as I am not a bird expert! (pause for polite chuckle.) For the purposes of this question, I am going to assume some priors about you mean when you say "survival" and "adaptation". If we are discussing these in the evolutionary sense, it's very difficult to understand the time scale and actual causality that would be needed to bring about any sort of assessment of how this one aspect of"See full answer

A S. - "Clarified with interviewer: How it is used ? user will give facebook page of school as input What is the criteria for declaring school as duplicate ? same name and location used exposed APIs of parent service to create and maintain a inverted index [msg queue+spark]. Duplicate matching service will use elastic search [and filter out input school page]. Elastic will search and return results of school name and geospatial matching ."See full answer

Michael B. - "Problem: Given a modified binary tree, where each node also has a pointer to it's parent, find the first common ancestor of two nodes. Answer: As it happens, the structure that we're looking at is actually a linked list (one pointer up), so the problem is identical to trying to find if two linked lists share a common node. How this works is by stacking the two chains of nodes together so they're the same length. chain1 = node1 chain2= node2 while True: chain1 = chain1.next chain2=chain"See full answer