Interview Questions

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

Alireza K. - "import random def coin_flip(): x=4*[0]+[1] res=[] for i in range(20): res.append(random.choice(x)) return res res=[0,0] # [head,tail] for j in range(1000): temp=coin_flip() res[0]+=sum(temp) #head res[1]+=(20-sum(temp)) #tail"See full answer

Mo I. - "m*n"See full answer

Kwaku K. - "Use a min-heap or sort the array, either method works"See full answer

Yuexiang Y. - "clarify: so does the 5% drop a sudden drop or overtime in the one week does it broadly drop 5% or it dropped only in some regions or in some segments like new acqusition / frequent active customers? or does the 5% drop also happened last year same period? DAU = acqusition x activation x retention segment: I will first quickly do some EDA to find out problem, like calculate the DAU drop in new customer, tenured customer, between regions to find out is there any difference. then I will also look"See full answer

Vineet M. - "Precision - Out of all the things we picked as correct, how many were actually correct? recall - Out of all the things that were truly correct, how many did we actually find?"See full answer

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

Nishant R. - "Recursively get the left height and right height of the sub-tree, and then check if it is balanced at this node, return false."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