Meta E5 USA Phone Screen
- Location
- USA
- Posted
- 13 May 2025
Summary
I had a phone screen for an E5 role at Meta in the USA, where I was asked to solve two LeetCode problems: Binary Tree Vertical Order Traversal and K Closest Points to Origin. I passed this round and am now scheduled for a full loop interview.
How it went
Had phone screen today
https://leetcode.com/problems/binary-tree-vertical-order-traversal/description/
Gave the tree and asked to figure out the order. I could not do it, so he gave me hint that it is vertically ordered.
For both problems, asked to print them.
Waiting for results.
Update: Pass. Full loop to be scheduled
Questions asked (2)
- 01
Binary Tree Vertical Order Traversal
Data Structures & Algorithms
Open the problemI was given a binary tree and asked to figure out its vertical order. The interviewer also specified that the result should be printed.
- 02
K Closest Points to Origin
Data Structures & Algorithms
Open the problemI was asked to solve the K Closest Points to Origin problem. The interviewer requested that I print the final results.