Meta | Facebook | Technical (Phone) Screen | Mid level Software Engineer (Java)
Summary
I recently completed my first technical phone screen at Meta for a Mid-level Software Engineer role, where I was tested on two data structure and algorithm problems.
Full Experience
I just got done with my first technical screen in Meta for a Mid-level Software Engineer position, specifically targeting Java roles. The interview involved two distinct data structure and algorithm questions. I felt prepared for both, and I'm looking forward to the next steps.
Interview Questions (2)
Given the root of a binary tree, find the minimum element present in each level. This problem is similar to a standard level-order traversal, but the objective is to track and return only the minimum value found within each level. A follow-up question was posed: how would one achieve this solution with an O(log n) space complexity?
Implement a `Sorted List Iterator` that operates on a collection of `k` sorted lists (given as a `List>`). The iterator should expose two primary functions:
public boolean hasNext(): Returnstrueif there are more elements to iterate,falseotherwise.public int next(): Returns the next minimum element across all `k` sorted lists.
This problem combines concepts from 'Merge K Sorted Lists' and an iterator design, specifically referencing an Airbnb interview question.