← Amazon questions

Shortest path from source to destination in matrix with obstacles

Filed under Amazon

Given a grid with 'S' (source), 'D' (destination), and '#' (obstacles), find the shortest path length from S to D using BFS.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.