โ† OYO questions

Knight's shortest path

Filed under OYO

Given an m x n chessboard, find the minimum number of moves required for a knight to travel from a starting position to a target position.

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 OYO questions

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