Meta E5 Usa Phone Screen

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.

Full Experience

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.

https://leetcode.com/problems/k-closest-points-to-origin/description/?envType=company&envId=facebook&favoriteSlug=facebook-thirty-days

For both problems, asked to print them.

Waiting for results.

Update: Pass. Full loop to be scheduled

Interview Questions (2)

Binary Tree Vertical Order Traversal

Data Structures & Algorithms

I was given a binary tree and asked to figure out its vertical order. The interviewer also specified that the result should be printed.

K Closest Points to Origin

Data Structures & Algorithms

I was asked to solve the K Closest Points to Origin problem. The interviewer requested that I print the final results.

Help the Community

Summary

Full Experience

Interview Questions (2)

Join the Discussion

No comments yet