Meta Full-loop questions

Summary

I am sharing the full-loop interview questions I encountered at Meta, covering system design, behavioral, and two coding rounds.

Hi, I am giving back to the community by sharing full loop questions.

System Desgin: desgin place recommender near user

Behavioral interview: normal questions; examples of success, what you learn from them ..etc

coding interview 1 (mid, hard):
- weighted sum of nested list LC339
- minimum flood level to remove all paths: similar to LC778
coding interview 2 (mid, mid):
- departure and return flights , given two arrays find the cheapest round flight
- merge intervals LC986

01
Design Place Recommender Near User
System Design
Design a system for recommending places near a user.
02
Behavioral Questions: Success and Learning
Behavioral
Standard behavioral questions, specifically focusing on examples of success and lessons learned from experiences.
03
Nested List Weight Sum
Data Structures & Algorithms
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). (Problem similar to LeetCode 339)
Open the problem
04
Swim in Rising Water (Minimum Flood Level)
Data Structures & Algorithms
Find the minimum flood level such that you can swim from the top-left to the bottom-right of a grid. (Problem similar to LeetCode 778)
Open the problem
05
Cheapest Round Flight
Data Structures & Algorithms
Given two arrays representing departure flights and return flights, find the cheapest round trip flight.
06
Interval List Intersections
Data Structures & Algorithms
Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order. Return the intersection of these two interval lists. (Problem similar to LeetCode 986)
Open the problem