Interview Questions

Ankush G. - " max Min 4, 3, 1 , 6, 7, 8 1 3 4 6 7 8 9 0 1 2 3 0 1 1 2 3 6 7 8 9 class MedianFinder{ std::priority_queue minHeap; std::priority_queue, greater> maxHeap; int numEleMaxheap = 0, numEleMinHeap = 0; public: void addNum( int n) { if(numEleMaxheap == numEleMinHeap ) { maxHeap.push(n); int maxofmaxheap = maxHeap.top(); maxHeap.pop(); "See full answer

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

Kitan F. - "I described why I liked the product Defined success metrics Proposed an A/B test"See full answer

Anonymous - "Functional requirements: (a) location tracking (b) check-in at nearby place (c) view historical checkins with how much time user stayed there (d) Mark checkout when out of proximity (e) analytics - checkins by user at given loc, top n places Out of scope: (a) checkin sharing with followers Non functional: (a) low latency (b) high availability (c) eventual consistency Scale: (a) QPS: 10M DAU * 2 checkins /86400 seconds (b) Yearly Data Volume: 10M* 0.1 KB *365 days HLD: user -> location servic"See full answer

Zvi D. - "printarr(subarr) for sub_arr in arr; function printarr(subarr) { print(elem) for elem in sub_arr }"See full answer

Exponent - "This is a Design a Product question. For this, we'll want to follow the formula for success: 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 early on s"See full answer

Darpan D. - "Clarifying and Assumptions Is there any specific geography we need to restrict to? Assumption: Total worldwide. Is there any specific segment we need to restrict to? Assumption: All segments. Number of users Total worldwide users: 300,000,000 Storage per user Slice the users into 3 segments. Low users 80% Free tier 2 GB per user available Using the 80-20 rule for segmentation. Medium users 10% Basic paid tier 2 TB per user available Usi"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

Padmanaban M. - "static int findLongestRepeatingSubSeq(String str) { int n = str.length(); int dp = new intn+1; for (int i=0; i<=n; i++) for (int j=0; j<=n; j++) dpi = 0; for (int i=1; i<=n; i++) { for (int j=1; j<=n; j++) { if (str.charAt(i-1)== str.charAt(j-1) && i != j) dpi =  1 + dpi-1; else dpi = Math.max(dpi, dpi-1); } } `return"See full answer