← Amazon questions

Robot path finding

Filed under Amazon

Given a grid of size m x n, a starting cell (r, c), and an integer k, return all unique non-self-intersecting paths of length k steps (k+1 cells) starting at (r, c). Cells cannot be revisited within a…

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.