LinkedIn·Software Engineer·Technical Phone Screen
Sep 2026
LinkedIn SWE coding round where I got a tree problem, implemented a working iterative postorder traversal, and then spent the bulk of the interview in a back-and-forth about space complexity and a line-by-line dry run. Only finished one question total, which has me second-guessing how the round will be read.
- Given a tree, return the nodes in the order they would be removed if you repeatedly removed all leaf nodes, grouping nodes by their height from the leaves.
“I went with an iterative postorder traversal using a stack where each frame tracked the node, a child iterator, and the max height seen so far among processed children.” The rest of the author's notes on Software Engineer interview at LinkedIn, 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