Interview Questions

Emma X. - "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 - "You should identify this type of interview question as an Expansion problem, since we're expanding to a new market. This is similar to a growth problem, with a few additional components. This is the formula you should use when tackling these types of interview questions: Ask clarifying questions Perform user analysis Market risk analysis State goals Perform channel analysis Prioritize growth channels Strategy Summarize Without further"See full answer

Exponent - "RealSelf is a healthcare marketplace where consumers research aesthetic treatments (plastic surgery, etc.) and connect with physicians. Think of it like the Yelp of cosmetic procedures. Right away we should identify this as an expansion problem. Recall the formula for this type of question: Ask clarifying questions Perform user analysis Market risk analysis State goals Perform channel analysis Prioritize growth channels Strategy **Summari"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

Sanobar K. - "public static Dictionary FindPairsWitkkDifference(int k, int[] nums) { Dictionary pairsWithkDifference = new Dictionary(); int n = nums.Length; if( n== 0 || n == 1) Return 0; for(int i =0; i< n;i++) { for(int j = i+1; j < n; j++) { if(Math.Abs(nums[i] - nums[j]) == k) { pairsWithkDifference(nums[i], nums[j]); } } } Return pairsWithkDifference ; }"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

Sagar T. - "It's already sorted."See full answer