Meta | Software Engineer | Tech Phone Screen
Timeline: 2025(Jul - Sep) • Fulltime • Other • Not specified
Candidate shares detailed experience of Meta’s Software Engineer phone screen including coding questions and strict timing.
Interview Questions
Tree Distance Sum Problem
Given a binary tree, you need to find the sum of distances from all nodes to a given target node. You can assume the tree is rooted at 0, and node values start from 0 and go up to n-1, where n is the number of nodes in the tree.
Difficulty: Medium | Reference: LC-1234 | Tags: DFS, Trees
Fibonacci Tree Path Calculation
You are given a binary tree that represents a Fibonacci sequence. Find the path from the root to the leaf node that gives the maximum sum of Fibonacci numbers along the path.
Difficulty: Medium | Reference: LC-5678 | Tags: Dynamic Programming, Trees