Shortest Path on Chess Board (BFS)
Waymo interview questions · Medium · Phone Screen round · reported 1× · 5 tests
Use BFS to find the fewest knight moves on a finite chessboard, optionally with blocked cells.
The full question, tests and reference solution are available with a plan that includes Waymo.
Run your code with Ctrl+Enter to see results.