Meta Interview Experience [IC4/London]
- Location
- London
- Posted
- 12 Jan 2026
Summary
I had a phone interview for an IC4 role at Meta in London. I was asked two specific data structures and algorithms questions, and received positive feedback, indicating that I will schedule a full loop soon.
How it went
Meta IC4 Phone Interview
Q1:
Given logs in following format: function, timestamp, type (b - begin, e - end)
Return the exclusive running time for each function (how much time function was actively running)
input foo 10 b bar 20 b bar 50 e foo 100 e
output foo 60 bar 30
foo is 60, even if 100-10=90, cause in the middle bar was actively running for 30 bar is 50-20=30
Q2:
given root of BST and int target return closest node whose value is closest to target
Next steps:
Positive feedback, will schedule Full loop soon
Questions asked (2)
- 01
Exclusive Running Time of Functions
Data Structures & Algorithms
Given logs in following format: function, timestamp, type (b - begin, e - end)
Return the exclusive running time for each function (how much time function was actively running)
input foo 10 b bar 20 b bar 50 e foo 100 e
output foo 60 bar 30
foo is 60, even if 100-10=90, cause in the middle bar was actively running for 30 bar is 50-20=30
- 02
Closest Node in BST to Target
Data Structures & Algorithms
given root of BST and int target return closest node whose value is closest to target