Meta Full Loop | Passed
- Location
- US
- Posted
- 19 May 2025
Summary
I passed the Meta full loop interview for an E4 role in the US, which included a phone screen, two technical rounds focusing on Data Structures & Algorithms, and a system design interview.
How it went
E4 US
Phone Screen
Range Sum of BST
Variation of Expression Add Operators (no multiplication)
Technical Round 1
Nested List Weight Sum
All Nodes Distance K in Binary Tree
Technical Round 2
Range Sum Query - Immutable
https://leetcode.com/problems/range-sum-query-immutable/description/
Shortest Path in Binary Matrix, follow up -> keep track of the shortest path
System Design
Design Facebook news feed
Questions asked (7)
- 01
Range Sum of BST
Data Structures & Algorithms
Open the problemGiven the root of a binary search tree, and two integers low and high, return the sum of all nodes' values that are in the inclusive range [low, high].
- 02
Expression Add Operators (Variation - no multiplication)
Data Structures & Algorithms
Open the problemGiven a string 'num' that contains only digits and an integer 'target', add binary operators (except multiplication, as specified in the variation) '+', '-' to 'num' such that their evaluation equals 'target'. Return all possible expressions that you can build.
- 03
Nested List Weight Sum
Data Structures & Algorithms
Open the problemGiven 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).
- 04
All Nodes Distance K in Binary Tree
Data Structures & Algorithms
Open the problemGiven the root of a binary tree, a target node in the tree, and an integer 'k', return an array of the values of all nodes that have a distance 'k' from the target node.
- 05
Range Sum Query - Immutable
Data Structures & Algorithms
Open the problemGiven an integer array 'nums', handle multiple queries of the following type: Calculate the sum of the elements of 'nums' between indices 'left' and 'right' inclusive ('nums[left]', 'nums[left + 1]', ..., 'nums[right]'). Implement the 'NumArray' class.
- 06
Shortest Path in Binary Matrix with Path Tracking
Data Structures & Algorithms
Open the problemGiven an n x n binary matrix 'grid', return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path is a path from the top-left cell (0, 0) to the bottom-right cell (n - 1, n - 1) such that all visited cells are 0. Follow up: keep track of the shortest path itself.
- 07
Design Facebook News Feed
System Design
Design a scalable system for the Facebook news feed, considering aspects like feed generation, fan-out approaches, storage, and real-time updates.