META full loop
- Result
- Ongoing
- Location
- bangalore
- Posted
- 7 Sept 2025
Summary
I recently completed the full interview loop with Meta, which included a technical screening, two coding rounds, a system design discussion on Netflix API, and behavioral questions. My preparation involved focusing on Meta's top 100 questions.
How it went
I recently went through the complete interview process for Meta. It began with an HR call, followed by an Online Assessment that covered both technical and behavioral aspects.
The technical screening involved a coding problem described as a 1D Candy Crush variation, for which a link to Max Consecutive Ones III was provided.
The full loop consisted of two intensive coding rounds. In the first coding round, I tackled 'Closest Value to Target in a BST' and Next Permutation. The second coding round presented Sum Root to Leaf Numbers and Simplify Path.
Following the coding rounds, I had a Product Design round where I was challenged to design the Netflix API. Finally, the Behavioral Round covered topics like my proudest project, a situation where I faced pushback, and my approach to unknown technical problems.
Questions asked (9)
- 01
Max Consecutive Ones III (1D Candy Crush variation)
Data Structures & Algorithms
Open the problemThis coding question was described as a 1D Candy Crush variation. A link to Max Consecutive Ones III was provided, suggesting the problem involves finding the longest subarray of 1s in a binary array with the ability to flip at most K zeros.
- 02
Closest Value to Target in a BST
Data Structures & Algorithms
I was asked to find the closest value to a given target in a Binary Search Tree (BST).
- 03
Next Permutation
Data Structures & Algorithms
Open the problemThe problem involved implementing the algorithm to find the next lexicographically greater permutation of numbers. A link to the LeetCode problem Next Permutation was provided.
- 04
Sum Root to Leaf Numbers
Data Structures & Algorithms
Open the problemI had to calculate the sum of all numbers formed by traversing root-to-leaf paths in a binary tree, where each path represents a number. A link to the LeetCode problem Sum Root to Leaf Numbers was provided.
- 05
Simplify Path
Data Structures & Algorithms
Open the problemThe task was to simplify a given Unix-style absolute path. A link to the LeetCode problem Simplify Path was provided.
- 06
Netflix API Design
System Design
In the Product Design round, I was tasked with designing the API for Netflix, which involved considering system architecture, scalability, and various functional requirements.
- 07
Proudest Project
Behavioral
I was asked to discuss my proudest project that I had worked on.
- 08
Facing Pushback
Behavioral
I had to describe a situation where I faced pushback and how I addressed it.
- 09
Approaching Unknown Technical Problems
Behavioral
I was asked about my approach when encountering unknown technical problems.
How they prepared
My preparation primarily focused on solving the top 100 Meta questions.