Had a screening interview for Meta a few days back.\nThey asked: \n1) [Kth largest element in the array](https://leetcode.com/problems/kth-largest-element-in-an-array/description/). \nProvided MinHeap solution.\n2) [Subarray sum equals k](https://leetcode.com/problems/subarray-sum-equals-k/description/). \nI was able to give cumulative sum solution\n\nResult: reject\nI guess the interviewer was looking for the most optimized solution.\n(Quick Select for Q1 and using HashMap for Q2)\n\nFollow up questions:\n1) Can you dry run your code for given example? \n2) How would you test your code? (My answer: check for boundary cases like empty array, null values, invalid chars in integer array)\n

Had a screening interview for Meta a few days back.\nThey asked: \n1) Kth largest element in the array. \nProvided MinHeap solution.\n2) Subarray sum equals k. 