Amazon·Software Engineer·Technical Phone Screen
- Implement an inorder traversal for an N-ary tree.
“Tricky part is that inorder for N-ary isn't as cleanly defined as it is for binary trees.”
FAANG / Big Tech
Most of these Amazon write-ups come from Software Engineers (1,092), then Data Scientists (182) and Product Managers (165). The most reported rounds are the technical phone screen (618), the behavioral / leadership round (309), the online assessment (228) and the system design round (159).
1581 interview notes · updated Oct 2026
“Tricky part is that inorder for N-ary isn't as cleanly defined as it is for binary trees.”
“The causal mask part is where I fumbled a bit.”
“This was basically seven questions stitched into one.”
“I went straight into the story without setting up the stakes first and I think that hurt me.”
“Jumped straight to Dijkstra which was right, but I fumbled explaining why BFS alone wouldn't work here.”
“I jumped to DFS pretty fast which was the right call, but I fumbled the visited-cell logic at first.”
“This is the core of the round apparently.”
“This was basically seven questions dressed up as one.”
“I went with DFS pretty quickly, marking visited cells in place to avoid extra space.”
“The silence after the prompt is genuinely uncomfortable.”