โ† Amazon questions

Knight reachability and minimum hops on finite board

Filed under Amazon

Given a finite chess board, a starting position, and a target position, determine if a knight can reach the target and find the minimum number of hops required.

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.