Meta Phone Screen US

Result
Ongoing
Location
us
Posted
12 May 2025
327 reads

Summary

I had a phone screen interview with Meta in the US, where I was asked two specific data structure and algorithm questions. I successfully passed this round.

How it went

I recently had my phone screen interview with Meta. The interview focused on two coding challenges. I was able to address both problems effectively, and I received a positive outcome for this round.

Questions asked (2)

  1. 01

    K Closest Points to Origin Variant

    Data Structures & Algorithms

    I was presented with a variant of the 'K Closest Points to Origin' problem. The core task was to identify and return only the single closest point to the origin, rather than a set of K points.

    Open the problem
  2. 02

    Lowest Common Ancestor of a Binary Tree

    Data Structures & Algorithms

    The second question was the classic 'Lowest Common Ancestor of a Binary Tree' problem, presented without any specific modifications or variations.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Meta recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!