← Amazon questions

Shortest Path in Grid with Special Diagonal Jumps

Filed under Amazon

Find the shortest path from a source point to a destination point in a 2D grid moving only up or right, given special points that allow single-step diagonal jumps to the top-right.

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.