Meta·Software Engineer·Technical Phone Screen
May 2026
Meta SWE coding round, one tree problem the whole time. Pretty focused session, they wanted the solution but also wanted me to explain the thinking behind it which I wasn't fully expecting.
- Given the root of a binary tree, find the diameter, defined as the maximum number of edges on any path between two nodes. Does the path have to go through the root? Walk through your solution and analyze its time and space complexity. Also handle the edge cases for empty trees and single-node trees.
“I knew the general idea going in but the 'does it pass through the root' part tripped me up for a second.” The rest of the author's notes on Software Engineer interview at Meta, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post