Drone Circular Route — Minimum Total Travel Cost
Company: Amazon
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Online Assessment
Overview: This question tests a candidate's ability to apply dynamic programming to combinatorial optimization, specifically the Traveling Salesman Problem (TSP) with bitmask DP. It evaluates practical algorithm design for asymmetric weighted graphs with up to 15 nodes, a classic pattern in software engineering interviews assessing graph traversal and optimization under exponential state spaces.
Read the full Amazon Software Engineer interview experience this question came from
