Interview Questions

Piyush D. - "Few clarifications questions, RealSelf is a platform/place where people go to look for best doctors for cosmetic surgeries and procedures? Am I correct? Interviewer: Yes. Cool. So as far as I know RealSelf has a very well designed experience where users can find best suitable treatments, procedures, reviews from the users who have undergone treatments and reviews of doctors/clinics. As a PM at RealSelf, I need to build a product which is not there already and which adds value to the mission o"See full answer

Exponent - "This is a Technical question. It tests your ability to understand high level technical concepts. Even though your job won't have any coding involved, you'll still need to understand these concepts. Being able to cover all these topics with clarity communicates confidence in your interviewer. Unfortunately, there's no formula for technical questions, but some general tips are: Use analogies when you can Break your solution into clear, bite-size steps Don't be afraid to use examples to b"See full answer

Sourav K. - "We can use a pool of memory where each index we can store the parent of current index then we can use same lca approach for array instead of pointers."See full answer

A Q. - "I would fire the ceo over bluejeans"See full answer

Exponent - "This is a Design a Product question. Let's follow the formula to make sure we cover all our bases: Ask clarifying questions Identify user types, behaviors, and pain points State the goal and use cases List current solutions Improvements / net new solutions Evaluate and select solutions Measure Success Summarize Ask clarifying questions It's important to get clarity on anything unclear. Asking questions also helps us limit scope earl"See full answer

Anonymous Eel - "String commonStr(String str1, String str2) { int len1 = str1.length(); int len2 = str2.length(); if (len1 == 0 || len2 == 0) return ""; // let dpx reprsent the longest common str of 0...x int dp = new int len1 + 1; int maxLen = 0; int endIndex = 0; for (int i = 1; i <= len1; i++) { for (int j = 1; j <= len2; j++) { if (str1.charAt(i-1) == str2.charAt(j-1)) { dpi = dpi-1 + 1; "See full answer

Exponent - "This many not look like it, but this is actually a Diagnosis problem. The twist here is that it's asking you to diagnose something positive. The approach is the same, so don't panic! 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 "See full answer