Meta Full Loop | Passed
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.
Full Experience
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
Interview Questions (7)
Given 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.
Design a scalable system for the Facebook news feed, considering aspects like feed generation, fan-out approaches, storage, and real-time updates.