Software Development Engineer 1
Weighted-Graph Shortest-Path Problem
Explain the brute-force approach for the weighted-graph shortest-path problem (Dijkstra's algorithm), move to the optimized solution, code it, and discuss its complexity and trade-offs. What would change if the constraints were different?
This question was asked in
Amazon Software Development Engineer 1 Interview Experience
The interview process with Amazon comprised five rounds, including an online assessment and multiple technical interviews. Questions focused on data structures and algorithms (DSA), debugging, leadership principles, system design, and the use of Generative AI in software development. The overall difficulty was medium to hard, with an emphasis on problem-solving and design skills, leaving a positive impression of the process.