Meta experience E4
- Location
- USA
- Posted
- 25 Apr 2025
Summary
I interviewed for an E4 role at Meta, going through a phone screen and virtual onsite that included coding, system design, and behavioral rounds. Unfortunately, I did not receive an offer, attributing it to insufficient preparation for problem variants.
How it went
Phone screen:
- Pivot number in an array, sum left = sum right
- Next permutation
Virtual onsite:
Coding 1:
- Lowest common ancestor in a binary tree - space optimize
- Minimum remove for valid parentheses - space optimize
Coding 2:
- Merge intervals with variant [2 separate sorted lists, combine them into one]
- Matrix path from top left to bottom right, return path
Product Architecture:
- Design Leetcode - Small scale Meta internal
Behavioral:
- Conflict resolution
- Architectural/code design decision you took and later regretted
- Gone above and beyond on some project/feature work
Location: USA
[Edit]: Thanks @CodingWithMinmer. After 2 weeks got the reply that I didn't make it. In a way, I was expecting this. I didn't prepare for the Variants. I got to know about the variants too late in my preparation.
Questions asked (10)
- 01
Pivot Index / Find Equilibrium Index
Data Structures & Algorithms · Easy
Given an array of integers, find the pivot index where the sum of the numbers to the left of the index is equal to the sum of the numbers to the right of the index.
- 02
Next Permutation
Data Structures & Algorithms · Medium
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
- 03
Lowest Common Ancestor of a Binary Tree (Space Optimized)
Data Structures & Algorithms · Medium
Find the lowest common ancestor (LCA) of two given nodes in a binary tree. The problem had a specific requirement for space optimization.
- 04
Minimum Remove to Make Valid Parentheses (Space Optimized)
Data Structures & Algorithms · Medium
Given a string
sof '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string. The problem had a specific requirement for space optimization. - 05
Merge Overlapping Intervals from Two Sorted Lists
Data Structures & Algorithms · Medium
Given two separate lists of sorted, non-overlapping intervals, merge all intervals from both lists into a single list of sorted, non-overlapping intervals.
- 06
Path from Top-Left to Bottom-Right in a Matrix
Data Structures & Algorithms · Medium
Given a matrix, find a path from the top-left cell to the bottom-right cell and return the sequence of cells in the path.
- 07
Design LeetCode (Small Scale, Meta Internal)
System Design · Hard
Design a system similar to LeetCode, tailored for small-scale internal use at Meta. This would involve considerations for problem storage, submission handling, test case execution, user management, etc.
- 08
Conflict Resolution
Behavioral
Describe a situation where you had a conflict with a coworker, manager, or project stakeholder, and how you resolved it.
- 09
Regretted Architectural/Code Design Decision
Behavioral
Discuss an architectural or code design decision you made that you later came to regret, explaining why it was regretted and what you learned from it.
- 10
Going Above and Beyond on a Project
Behavioral
Share an example where you went above and beyond your standard responsibilities on a project or feature work.
How they prepared
I realized I didn't prepare adequately for problem variants, which I encountered late in my preparation.