Meta Full Loop (E4/E5) | Product SWE | Passed
- Experience
- 6 years
- Posted
- 4 Apr 2025
Summary
I recently completed a full loop interview at Meta for a Product SWE (E4/E5) role and successfully moved to the team matching phase. I was downleveled from E4/E5 largely due to mismanaging time in the Product Architecture round.
How it went
Hi All,
Giving back to community. Recently I gave full loop and moved to team matching phase.
Phone screen :
- Merge 3 sorted array
- not on leetcode (but it was LC easy level)
Onsite
Coding - 1
- LC-236
- LC-658
Coding - 2
- LC-766
- LC-199 - with left
Product Architecture
- From top 10 in hellointerview
Behaviour
- Typical questions related to conflict, achievement, growth, etc.
Huge shout-out to CodingWithMinmer for all variations and OG (my most of questions were from the problems he covered).
For design, please manage time efficiently. My interviewer left completly on me in terms of time management and I misjudged it thinking that he's fine covering initial design and could only get 5-10 minutes for deep-dive. So, you are on your own in terms of time management. Got downleveled because of that. Do a mock round please!
YOE : 6 years TC : 160k gbp
Questions asked (5)
- 01
Merge 3 Sorted Arrays
Data Structures & Algorithms
Merge three given sorted arrays into a single sorted array.
- 02
Lowest Common Ancestor of a Binary Tree
Data Structures & Algorithms · Medium
Open the problemGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
- 03
Find K Closest Elements
Data Structures & Algorithms · Medium
Open the problemGiven a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
- 04
Toeplitz Matrix
Data Structures & Algorithms · Easy
Open the problemGiven an m x n matrix, return true if the matrix is Toeplitz. Otherwise, return false. A matrix is Toeplitz if every diagonal from the top-left to the bottom-right has the same elements.
- 05
Binary Tree Right Side View
Data Structures & Algorithms · Medium
Open the problemGiven the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. The problem included a variation, 'with left'.
How they prepared
I utilized CodingWithMinmer for various coding problem variations. For system design, I recommend efficient time management and mock rounds, learning from my experience where misjudging time led to downleveling.