Meta E6/E5 Experience
- Result
- Offer
- Experience
- 9 years
- Posted
- 8 Oct 2025
Summary
I recently interviewed with Meta for an E6/E5 role. After a successful phone screen and strong performance in most onsite rounds, I received a downlevel offer for an E5 position and am currently in the team matching phase.
How it went
My interview journey with Meta started with a phone screen, which included both a coding and a behavioral segment. For coding, I tackled Merge Two Sorted Arrays and a variant of Time Based Key-Value Store. The interviewer for the latter asked me to implement a treemap from scratch, and I managed to build all core functionalities, excluding tree balancing due to time limits. The behavioral part focused on conflict resolution, with several follow-up questions.
The onsite interviews for the E6 level were quite comprehensive. I had two system design rounds: one for Designing a Price Tracking and Alerting System and another for Designing a Create and Search System for Posts. Unfortunately, I couldn't deep dive into the second system design problem as much as I would have liked.
My coding rounds were intense. In the first coding session, I worked on Count Nodes Equal to Average of Subtree and a variant of Minimum Window Substring, each with a couple of follow-up questions. The second coding round presented Nested List Weight Sum and Find Kth Smallest Element Amongst N Sorted Arrays. I struggled to get to the follow-up for the second problem due to time.
Finally, I had a behavioral interview with 7-8 questions covering aspects like scope, impact, and how I handle conflicts. Overall, I felt that most of my interviews went almost perfectly.
The outcome was a downlevel to E5, and I am now in the team matching phase.
Questions asked (10)
- 01
Merge Two Sorted Arrays
Data Structures & Algorithms · Easy
Merge two given sorted arrays into a single sorted array.
- 02
Time Based Key-Value Store (Variant)
Data Structures & Algorithms · Medium
A variant of the Time Based Key-Value Store problem. I was asked to implement a treemap data structure from scratch, including its core functionalities, excluding the tree balancing part.
- 03
Conflict Resolution
Behavioral
Behavioral question focused on how I resolve conflicts, followed by several follow-up questions.
- 04
Design a Price Tracking and Alerting System
System Design · Hard
Design a system capable of tracking product prices and sending alerts when prices change or meet certain criteria.
- 05
Design a Create and Search System for Posts
System Design · Hard
Design a system that allows users to create posts and search for existing posts efficiently.
- 06
Count Nodes Equal to Average of Subtree
Data Structures & Algorithms · Medium
Count the number of nodes in a binary tree where the node's value is equal to the average of the values in its subtree (including the node itself).
- 07
Minimum Window Substring (Variant)
Data Structures & Algorithms · Hard
A variant of the Minimum Window Substring problem, followed by 1-2 follow-up questions.
- 08
Nested List Weight Sum
Data Structures & Algorithms · Medium
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer or a list -- whose elements may also be integers or other lists.
- 09
Find Kth Smallest Element Amongst N Sorted Arrays
Data Structures & Algorithms · Hard
Find the kth smallest element among N given sorted arrays, followed by follow-up questions.
- 10
General Behavioral Questions
Behavioral
A session with 7-8 behavioral questions covering topics such as scope, impact, and conflict resolution.