#### Details\n**Status**: 3 YOE\n**Position**: SDE2 at Meta\n**Location**: Remote\n**Date**: Mar 2022\n\n#### Phone screen (45 min):\n1. [Kth largest elements in an array](https://leetcode.com/problems/kth-largest-element-in-an-array/)\n\t2. Note: I didn\'t use the most optimal solution (quick sort) here\n3. [Minimum remove to make parentheses valid](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)\n\n#### On-site (5 rounds, 45min each):\n\n1. System Design - Design Facebook Messenger\n2. Behavioral\n3. Coding\n\t4. [Valid Palindrome III](https://leetcode.com/problems/valid-palindrome-iii/)\n\t5. [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) (given positive integers)\n4. Coding\n\t5. Given an array of sorted integers, find all missing numbers within the range [0, 99]. If the range exceeds 2, output a range in the format `start-end`. \n\t6. [Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)\n5. Coding\n\t6. Merge 3 sorted arrays (variation of [Merge K-Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/))\n\t7. [Lowest Comon Ancestor of Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)\n\n#### Notes\nThe problems definitely seemed to increase in difficulty for the on-site, not sure if that\'s necessarily true across the board, though. I also noticed that some of the problems were templates of common LeetCode questions but with an additional twist. In that regard, it definitely helps to know *why* a solution works and to comprehend it fully. I did interview prep for about 6 months and performed well on my other interviews but this one in particular I found to be quite difficult. Decent experience overall but they are definitely looking for LeetCode-robots.

Details\nStatus: 3 YOE\nPosition: SDE2 at Meta\nLocation: Remote\nDate: Mar 2022\n\n#### Phone screen (45 min):\n1. Kth largest elements in an array\n\t2. Note: