Amazon·Software Engineer·Technical Phone Screen
- Find the shortest path between two nodes in a graph.
“Went with BFS for unweighted, mentioned Dijkstra for weighted.”
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
“Went with BFS for unweighted, mentioned Dijkstra for weighted.”
“The null is straightforward, coin is fair so p=0.5.”
“I had a decent story for this but I think I buried the lead.”
“My first instinct was to go forward from (a, b) and BFS toward (c, d), but the values can balloon fast and I started second-guessing the bounds.”
“I started with behavioral segments like engagement frequency and feature usage, then layered in tenure and plan type.”
“The setup looks clean until you realize you need to seed the queue with all sources at distance zero simultaneously, not run separate BFS passes and take the min afterward.”
“Classic sliding window with a zero-count tracker.”
“I'd been prepping for the harder behavioral stuff and kind of assumed this one would be a gimme.”
“The part I fumbled was quantifying the impact.”
“My first instinct was greedy and it was wrong.”