Interview Questions

Exponent - "This is another 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 "See full answer

Jx J. - "Sir Assalamu Alaikum. How are you? I am from this company. Our water is the best. Your store is running out of water. Our drinking is the most profitable. Ours is superior to all other waters."See full answer

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 - "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