Meta E5 Onsite Loop | Bangalore
Summary
I went through a comprehensive E5 onsite interview loop at Meta in Bangalore, which included a phone screen, two data structures and algorithms rounds, a product architecture design round, and a critical behavioral round.
Full Experience
Phone screen : https://leetcode.com/discuss/post/6560544/meta-e5-phone-screen-passed-by-anonymous-30p2/
Round 1 (DSA)
- Q1: https://leetcode.com/problems/merge-sorted-array/description/
size of first array is n+m, where n is the size of elemetns in first array and m is size of elements in second array - Q2: https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/
I solved both questions within 25 minutes. The interviewer then asked a follow-up question on the second problem.
Round 2 (DSA)
- Q1: https://leetcode.com/problems/palindrome-linked-list/description/
- Q2: https://leetcode.com/problems/kth-missing-positive-number/description/ (I solved this problem two days before my onsite interview as part of LeetCode's daily challenge)
Round 3 (Product Architecture Design)
This round focused on designing a coding platform like leetcode, with major discussions around supporting multiple concurrent competitions.
Round 4 (Behavioral)
This is the most crucial round at Meta. You need to be 100% confident in the stories you present. Avoid fabricating experiences—they can easily detect inconsistencies.
Interview Questions (5)
Merge Sorted Array
size of first array is n+m, where n is the size of elemetns in first array and m is size of elements in second array
Minimum Remove to Make Valid Parentheses
Palindrome Linked List
Kth Missing Positive Number
Design a Coding Platform like LeetCode
This round focused on designing a coding platform like leetcode, with major discussions around supporting multiple concurrent competitions.
Preparation Tips
I solved one of the DSA problems (Kth Missing Positive Number) as part of LeetCode's daily challenge two days before my onsite interview.