Meta | E5 (Prod) Onsite | U.S. | Rejected
- Result
- Rejected
- Location
- U.S.
- Posted
- 25 Sept 2025
Summary
I interviewed for an E5 (Prod) Engineer role at Meta in the U.S. After navigating through both phone and onsite rounds, I unfortunately received a rejection, which left me feeling quite exhausted.
How it went
My interview process for the E5 (Prod) Engineer position at Meta in the U.S. involved two main stages: a phone screen and an onsite loop.
The phone screen included two coding problems:
- Binary Tree Vertical Order Traversal
- Minimum Window Substring
The onsite interviews were quite intensive, covering a range of topics:
- Coding Round 1: Buildings With an Ocean View, with a follow-up on handling views from two sides.
- Coding Round 2: A modified version of Insert Delete GetRandom O(1) - Duplicates allowed, where the
remove()function wouldn't take a value, and the value to be removed had to be random. - Coding Round 3: Power(x,n)
- Coding Round 4: Minimum Remove to Make Valid Parentheses
- System Design: Design Netflix
- Behavioral: A standard behavioral questions round.
I heard back after about a week. Despite my efforts, I was rejected. The process took a lot of my time and energy, and honestly, I'm feeling quite exhausted and low on motivation now. Good luck to others going through it.
Questions asked (7)
- 01
Binary Tree Vertical Order Traversal
Data Structures & Algorithms
Open the problemGiven the
rootof a binary tree, return the vertical order traversal of its nodes' values. (i.e., from top to bottom, column by column). - 02
Minimum Window Substring
Data Structures & Algorithms
Open the problemGiven two strings
sandtof lengthsmandnrespectively, return the minimum window substring ofssuch that every character int(including duplicates) is included in the window. If there is no such substring, return the empty string"". - 03
Buildings With an Ocean View
Data Structures & Algorithms
Open the problemYou are given an integer array
heightsof sizenrepresenting the heights ofnbuildings located from left to right. Return an array of the indices of the buildings that have an ocean view. A building has an ocean view if all the buildings to its right are strictly shorter than it. Follow up: Consider the scenario where you can view from two sides (left and right). - 04
Insert Delete GetRandom O(1) - Duplicates allowed (Custom Remove)
Data Structures & Algorithms
Open the problemDesign a data structure that supports
insert,remove, andgetRandomoperations in average O(1) time, allowing duplicates. The custom constraint forremove()is that it does not take a value; instead, the value to be removed has to be random. - 05
Power(x,n)
Data Structures & Algorithms
Open the problemImplement
pow(x, n), which calculatesxraised to the powern(x^n). - 06
Minimum Remove to Make Valid Parentheses
Data Structures & Algorithms
Open the problemGiven a string
sof'(',')'and lowercase English characters, remove the minimum number of parentheses to makesvalid. Return the string after removing the minimum number of invalid parentheses. - 07
Design Netflix
System Design
Design a system similar to Netflix.