Meta IC4 London
- Result
- Ongoing
- Location
- london
- Posted
- 2 Sept 2025
Summary
I recently interviewed at Meta for an IC4 position in London and successfully advanced to the team matching phase after completing a phone screen, two coding rounds, system design, and a behavioral interview.
How it went
I had a recent interview experience at Meta for an IC4 position in London. The interview process consisted of a phone screen, followed by two coding rounds, a system design interview, and a behavioral interview. I am glad to share that I have received a mail today indicating that they are moving me to the team matching phase. It's a positive step forward, and I'm hopeful for the next stage.
Questions asked (6)
- 01
Insert Delete GetRandom O(1) - Small Variation
Data Structures & Algorithms
Open the problemThis was a small variation of the classic LeetCode problem 'Insert Delete GetRandom O(1)'.
- 02
Count Distinct Elements in Very Large Sorted Array
Data Structures & Algorithms
Given a very large sorted array (length > 1010), the task was to count the distinct elements.
Input: arr[] = {1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 5, 5, 7, 7, 8, 8, 9, 9, 10, 11, 12}
Output: 10
Explanation: The 10 unique elements are: 1, 2, 3, 5, 7, 8, 9, 10, 11, 12 - 03
Nested List Weight Sum
Data Structures & Algorithms
Open the problemThe problem involved calculating the nested list weight sum as described in the LeetCode problem.
- 04
Minimum Remove to Make Valid Parentheses
Data Structures & Algorithms
Open the problemI was asked to solve the 'Minimum Remove to Make Valid Parentheses' problem.
- 05
Minimum Window Substring (No Duplicates in T)
Data Structures & Algorithms
Open the problemThis was a version of the 'Minimum Window Substring' problem, with the simplification that there were no duplicate characters in string 't'.
- 06
Binary Tree Side Views with Twist and Leaves
Data Structures & Algorithms
I was asked to implement the right side view of a binary tree, but from leaf to root, and the left side view from root to leaf. After successfully completing this, the interviewer then asked me to also return all the leaf nodes as part of the solution.