Given a chessboard of size N x N, find the minimum number of moves a knight needs to reach a target position (x2, y2) from a starting position (x1, y1).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.