Meta phone screen 45 mins

Posted
31 May 2025
312 reads

Summary

I had a 45-minute phone screen with Meta, where I was asked two specific data structures and algorithms problems.

How it went

Meta Phone Screen Questions (2025)

Question 1: Insert a value into a sorted circular linked list and return the newly inserted node. ➤ Similar LeetCode: 708. Insert into a Sorted Circular Linked List

Question 2: Given a binary tree node, return True if every node’s value is equal to the floor of the average of its descendants (excluding itself). ➤ Similar LeetCode: 2265. Count Nodes Equal to Average of Subtree (Note: The original LC question counts such nodes; this variation checks that all nodes satisfy the condition.)

Questions asked (2)

  1. 01

    Insert into Sorted Circular Linked List

    Data Structures & Algorithms

    Insert a value into a sorted circular linked list and return the newly inserted node.

    Open the problem
  2. 02

    Check Nodes Equal to Average of Descendants

    Data Structures & Algorithms

    Given a binary tree node, return True if every node’s value is equal to the floor of the average of its descendants (excluding itself). (Note: The original LC question counts such nodes; this variation checks that all nodes satisfy the condition.)

    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!