Meta E5 | SWE Product | Full loop
- Location
- Bay area
- Posted
- 30 May 2025
Summary
I underwent a full loop interview for an E5 SWE Product role at Meta, which included two coding rounds and a product architecture round.
How it went
Coding 1:
- Q1. Minimum remove for valid parenthesis
- Q2. Lowest common ancestor in a tree
Coding 2:
- Q1. variation of weighted sum of nested array
- Q2. variation of shortest distance from all buildings (multisource BFS)
Prod Arch:
hackerrank live contest leaderboard with quite a few custom functional requirements
Edit: Bay area location
Questions asked (5)
- 01
Minimum Remove to Make Valid Parentheses
Data Structures & Algorithms · Medium
Given a string
sof'(',')', and lowercase English characters. Your task is to remove the minimum number of parentheses so that the resulting parentheses string is valid. Return any valid string. - 02
Lowest Common Ancestor of a Binary Tree
Data Structures & Algorithms · Medium
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
- 03
Variation of Weighted Sum of Nested Array
Data Structures & Algorithms · Medium
Calculate the weighted sum of integers in a nested list structure. The specific variation was not detailed, but generally involves defining weights based on depth or reverse depth for each integer in the nested array.
- 04
Variation of Shortest Distance from All Buildings
Data Structures & Algorithms · Hard
Given a 2D grid where each cell can be one of three values: 0 (empty land), 1 (building), or 2 (obstacle). A variation of finding the shortest total distance from an empty land cell to all buildings. The candidate mentioned a multisource BFS approach, hinting at the standard solution pattern.
- 05
Design HackerRank Live Contest Leaderboard
System Design
Design a system for a live contest leaderboard similar to HackerRank, accommodating various custom functional requirements that were not explicitly stated.